java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:08:38,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:08:38,863 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:08:38,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:08:38,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:08:38,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:08:38,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:08:38,882 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:08:38,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:08:38,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:08:38,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:08:38,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:08:38,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:08:38,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:08:38,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:08:38,891 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:08:38,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:08:38,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:08:38,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:08:38,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:08:38,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:08:38,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:08:38,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:08:38,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:08:38,903 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:08:38,904 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:08:38,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:08:38,905 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:08:38,905 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:08:38,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:08:38,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:08:38,906 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:08:38,915 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:08:38,915 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:08:38,916 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:08:38,916 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:08:38,916 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:08:38,916 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:08:38,916 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:08:38,917 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:08:38,917 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:08:38,917 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:08:38,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:08:38,917 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:08:38,917 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:08:38,917 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:08:38,917 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:08:38,918 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:08:38,918 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:08:38,918 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:08:38,918 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:08:38,918 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:08:38,918 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:08:38,918 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:08:38,919 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:08:38,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:08:38,919 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:08:38,919 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:08:38,919 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:08:38,919 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:08:38,920 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:08:38,920 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:08:38,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:08:38,920 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:08:38,921 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:08:38,921 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:08:38,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:08:38,964 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:08:38,967 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:08:38,969 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:08:38,969 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:08:38,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-30 00:08:39,146 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:08:39,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:08:39,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:08:39,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:08:39,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:08:39,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:08:39" (1/1) ... [2018-01-30 00:08:39,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715ee194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:08:39, skipping insertion in model container [2018-01-30 00:08:39,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:08:39" (1/1) ... [2018-01-30 00:08:39,175 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:08:39,223 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:08:39,336 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:08:39,356 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:08:39,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:08:39 WrapperNode [2018-01-30 00:08:39,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:08:39,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:08:39,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:08:39,365 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:08:39,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:08:39" (1/1) ... [2018-01-30 00:08:39,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:08:39" (1/1) ... [2018-01-30 00:08:39,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:08:39" (1/1) ... [2018-01-30 00:08:39,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:08:39" (1/1) ... [2018-01-30 00:08:39,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:08:39" (1/1) ... [2018-01-30 00:08:39,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:08:39" (1/1) ... [2018-01-30 00:08:39,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:08:39" (1/1) ... [2018-01-30 00:08:39,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:08:39,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:08:39,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:08:39,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:08:39,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:08:39" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:08:39,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:08:39,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:08:39,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:08:39,445 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-30 00:08:39,445 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-30 00:08:39,445 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-30 00:08:39,445 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-30 00:08:39,445 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-30 00:08:39,445 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:08:39,445 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:08:39,445 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:08:39,445 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:08:39,446 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:08:39,446 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:08:39,446 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:08:39,446 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:08:39,446 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:08:39,446 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-30 00:08:39,446 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-30 00:08:39,446 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:08:39,446 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:08:39,447 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-30 00:08:39,447 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:08:39,447 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-30 00:08:39,447 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-30 00:08:39,447 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-30 00:08:39,447 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-30 00:08:39,448 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-30 00:08:39,448 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:08:39,448 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:08:39,448 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:08:39,448 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:08:39,586 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 00:08:39,693 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:08:39,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:08:39 BoogieIcfgContainer [2018-01-30 00:08:39,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:08:39,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:08:39,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:08:39,699 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:08:39,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:08:39" (1/3) ... [2018-01-30 00:08:39,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ff79da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:08:39, skipping insertion in model container [2018-01-30 00:08:39,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:08:39" (2/3) ... [2018-01-30 00:08:39,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ff79da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:08:39, skipping insertion in model container [2018-01-30 00:08:39,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:08:39" (3/3) ... [2018-01-30 00:08:39,703 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-30 00:08:39,712 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:08:39,719 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-30 00:08:39,769 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:08:39,769 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:08:39,770 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:08:39,770 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:08:39,770 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:08:39,770 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:08:39,770 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:08:39,770 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:08:39,771 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:08:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-01-30 00:08:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:08:39,797 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:39,798 INFO L350 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] [2018-01-30 00:08:39,798 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:39,803 INFO L82 PathProgramCache]: Analyzing trace with hash -319557672, now seen corresponding path program 1 times [2018-01-30 00:08:39,805 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:39,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:39,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:39,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:39,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:39,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:40,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:08:40,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:08:40,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:08:40,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:08:40,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:08:40,173 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 5 states. [2018-01-30 00:08:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:40,310 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2018-01-30 00:08:40,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:08:40,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-30 00:08:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:40,326 INFO L225 Difference]: With dead ends: 136 [2018-01-30 00:08:40,326 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 00:08:40,330 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:08:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 00:08:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-01-30 00:08:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-30 00:08:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-01-30 00:08:40,367 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 22 [2018-01-30 00:08:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:40,367 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-01-30 00:08:40,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:08:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-01-30 00:08:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 00:08:40,368 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:40,368 INFO L350 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] [2018-01-30 00:08:40,369 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash -285015550, now seen corresponding path program 1 times [2018-01-30 00:08:40,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:40,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:40,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:40,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:40,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:40,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:40,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:08:40,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:08:40,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:08:40,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:08:40,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:08:40,680 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 7 states. [2018-01-30 00:08:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:40,934 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-30 00:08:40,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:08:40,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-30 00:08:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:40,936 INFO L225 Difference]: With dead ends: 82 [2018-01-30 00:08:40,937 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 00:08:40,937 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:08:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 00:08:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-01-30 00:08:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 00:08:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-30 00:08:40,948 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 23 [2018-01-30 00:08:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:40,949 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-30 00:08:40,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:08:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-30 00:08:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 00:08:40,950 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:40,950 INFO L350 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] [2018-01-30 00:08:40,950 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:40,951 INFO L82 PathProgramCache]: Analyzing trace with hash -285015551, now seen corresponding path program 1 times [2018-01-30 00:08:40,951 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:40,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:40,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:40,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:40,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:40,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:41,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:08:41,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:08:41,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:08:41,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:08:41,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:08:41,014 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 6 states. [2018-01-30 00:08:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:41,120 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-01-30 00:08:41,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:08:41,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-30 00:08:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:41,122 INFO L225 Difference]: With dead ends: 81 [2018-01-30 00:08:41,122 INFO L226 Difference]: Without dead ends: 80 [2018-01-30 00:08:41,122 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:08:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-30 00:08:41,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-01-30 00:08:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 00:08:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-30 00:08:41,130 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 23 [2018-01-30 00:08:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:41,130 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-30 00:08:41,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:08:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-30 00:08:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 00:08:41,131 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:41,131 INFO L350 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] [2018-01-30 00:08:41,132 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:41,132 INFO L82 PathProgramCache]: Analyzing trace with hash 295001646, now seen corresponding path program 1 times [2018-01-30 00:08:41,132 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:41,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:41,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:41,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:41,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:41,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:41,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:08:41,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:08:41,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:08:41,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:08:41,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:08:41,184 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 3 states. [2018-01-30 00:08:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:41,246 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-01-30 00:08:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:08:41,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-30 00:08:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:41,248 INFO L225 Difference]: With dead ends: 86 [2018-01-30 00:08:41,248 INFO L226 Difference]: Without dead ends: 70 [2018-01-30 00:08:41,248 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:08:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-30 00:08:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-30 00:08:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-30 00:08:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-01-30 00:08:41,254 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 29 [2018-01-30 00:08:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:41,255 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-01-30 00:08:41,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:08:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-01-30 00:08:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:08:41,256 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:41,256 INFO L350 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] [2018-01-30 00:08:41,256 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1354721476, now seen corresponding path program 1 times [2018-01-30 00:08:41,257 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:41,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:41,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:41,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:41,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:41,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:41,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:08:41,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:08:41,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:08:41,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:08:41,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:08:41,317 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2018-01-30 00:08:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:41,343 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-01-30 00:08:41,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:08:41,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-30 00:08:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:41,347 INFO L225 Difference]: With dead ends: 78 [2018-01-30 00:08:41,347 INFO L226 Difference]: Without dead ends: 69 [2018-01-30 00:08:41,348 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:08:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-30 00:08:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-30 00:08:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-30 00:08:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-01-30 00:08:41,358 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2018-01-30 00:08:41,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:41,358 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-01-30 00:08:41,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:08:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-01-30 00:08:41,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 00:08:41,360 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:41,360 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:41,360 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:41,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1004761274, now seen corresponding path program 1 times [2018-01-30 00:08:41,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:41,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:41,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:41,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:41,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:41,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:41,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:08:41,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:08:41,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:08:41,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:08:41,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:08:41,505 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 10 states. [2018-01-30 00:08:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:41,786 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-01-30 00:08:41,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:08:41,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-30 00:08:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:41,787 INFO L225 Difference]: With dead ends: 69 [2018-01-30 00:08:41,787 INFO L226 Difference]: Without dead ends: 68 [2018-01-30 00:08:41,788 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:08:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-30 00:08:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-30 00:08:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-30 00:08:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-01-30 00:08:41,796 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 39 [2018-01-30 00:08:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:41,796 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-01-30 00:08:41,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:08:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-01-30 00:08:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 00:08:41,797 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:41,797 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:41,797 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:41,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1004761275, now seen corresponding path program 1 times [2018-01-30 00:08:41,798 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:41,798 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:41,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:41,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:41,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:41,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:41,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:08:41,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:08:41,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:08:41,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:08:41,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:08:41,848 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 4 states. [2018-01-30 00:08:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:41,891 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-01-30 00:08:41,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:08:41,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-30 00:08:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:41,897 INFO L225 Difference]: With dead ends: 110 [2018-01-30 00:08:41,897 INFO L226 Difference]: Without dead ends: 72 [2018-01-30 00:08:41,898 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:08:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-30 00:08:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-01-30 00:08:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-30 00:08:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-01-30 00:08:41,906 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 39 [2018-01-30 00:08:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:41,906 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-01-30 00:08:41,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:08:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-01-30 00:08:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:08:41,907 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:41,908 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:41,908 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1624195129, now seen corresponding path program 1 times [2018-01-30 00:08:41,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:41,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:41,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:41,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:41,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:41,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:41,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:08:41,976 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:08:41,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:42,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:08:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:42,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:08:42,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-30 00:08:42,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:08:42,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:08:42,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:08:42,081 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 6 states. [2018-01-30 00:08:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:42,137 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-01-30 00:08:42,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:08:42,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-30 00:08:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:42,139 INFO L225 Difference]: With dead ends: 114 [2018-01-30 00:08:42,139 INFO L226 Difference]: Without dead ends: 76 [2018-01-30 00:08:42,140 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:08:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-30 00:08:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-01-30 00:08:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-30 00:08:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-01-30 00:08:42,148 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 43 [2018-01-30 00:08:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:42,148 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-01-30 00:08:42,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:08:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-01-30 00:08:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 00:08:42,149 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:42,150 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:42,150 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2077548361, now seen corresponding path program 2 times [2018-01-30 00:08:42,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:42,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:42,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:42,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:42,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:42,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:42,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:08:42,246 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:08:42,257 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:08:42,286 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:42,299 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:08:42,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:08:42,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-30 00:08:42,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:08:42,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 00:08:42,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:08:42,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:08:42,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-30 00:08:42,983 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-30 00:08:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-30 00:08:43,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:08:43,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-30 00:08:43,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 00:08:43,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 00:08:43,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-30 00:08:43,328 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 19 states. [2018-01-30 00:08:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:44,241 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-01-30 00:08:44,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-30 00:08:44,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-01-30 00:08:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:44,242 INFO L225 Difference]: With dead ends: 117 [2018-01-30 00:08:44,243 INFO L226 Difference]: Without dead ends: 79 [2018-01-30 00:08:44,244 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-01-30 00:08:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-30 00:08:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-01-30 00:08:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-30 00:08:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-01-30 00:08:44,254 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 47 [2018-01-30 00:08:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:44,254 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-01-30 00:08:44,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 00:08:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-01-30 00:08:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:08:44,255 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:44,256 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:44,256 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash 557031604, now seen corresponding path program 1 times [2018-01-30 00:08:44,256 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:44,256 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:44,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:44,258 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:08:44,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:44,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 00:08:44,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:08:44,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-30 00:08:44,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:08:44,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:08:44,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:08:44,421 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 12 states. [2018-01-30 00:08:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:44,689 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-01-30 00:08:44,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:08:44,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-30 00:08:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:44,690 INFO L225 Difference]: With dead ends: 76 [2018-01-30 00:08:44,690 INFO L226 Difference]: Without dead ends: 74 [2018-01-30 00:08:44,690 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:08:44,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-30 00:08:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-30 00:08:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-30 00:08:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-01-30 00:08:44,697 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 56 [2018-01-30 00:08:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:44,697 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-01-30 00:08:44,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:08:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-01-30 00:08:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:08:44,698 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:44,698 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:44,698 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:44,698 INFO L82 PathProgramCache]: Analyzing trace with hash 557031605, now seen corresponding path program 1 times [2018-01-30 00:08:44,698 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:44,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:44,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:44,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:44,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:44,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:44,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:08:44,780 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:08:44,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:44,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:08:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:44,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:08:44,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-30 00:08:44,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:08:44,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:08:44,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:08:44,883 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 8 states. [2018-01-30 00:08:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:44,925 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-01-30 00:08:44,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:08:44,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-30 00:08:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:44,927 INFO L225 Difference]: With dead ends: 116 [2018-01-30 00:08:44,927 INFO L226 Difference]: Without dead ends: 81 [2018-01-30 00:08:44,928 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:08:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-30 00:08:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-01-30 00:08:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 00:08:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-01-30 00:08:44,939 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 56 [2018-01-30 00:08:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:44,939 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-01-30 00:08:44,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:08:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-01-30 00:08:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-30 00:08:44,941 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:44,941 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:44,941 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash -984810249, now seen corresponding path program 2 times [2018-01-30 00:08:44,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:44,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:44,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:44,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:44,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:44,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:45,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:08:45,038 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:08:45,043 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:08:45,062 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:45,065 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:08:45,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:08:45,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-30 00:08:45,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:08:45,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-30 00:08:45,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:08:45,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:08:45,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-30 00:08:47,284 WARN L143 SmtUtils]: Spent 2034ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-30 00:08:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-30 00:08:47,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:08:47,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-30 00:08:47,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 00:08:47,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 00:08:47,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:08:47,708 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 22 states. [2018-01-30 00:08:51,852 WARN L143 SmtUtils]: Spent 4034ms on a formula simplification that was a NOOP. DAG size: 39 [2018-01-30 00:08:54,071 WARN L143 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-30 00:08:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:54,636 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-01-30 00:08:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:08:54,636 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-01-30 00:08:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:54,637 INFO L225 Difference]: With dead ends: 118 [2018-01-30 00:08:54,637 INFO L226 Difference]: Without dead ends: 83 [2018-01-30 00:08:54,638 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:08:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-30 00:08:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-01-30 00:08:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-30 00:08:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-01-30 00:08:54,647 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 60 [2018-01-30 00:08:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:54,648 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-01-30 00:08:54,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 00:08:54,648 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-01-30 00:08:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-30 00:08:54,649 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:54,649 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:54,649 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:54,649 INFO L82 PathProgramCache]: Analyzing trace with hash 554912594, now seen corresponding path program 1 times [2018-01-30 00:08:54,649 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:54,650 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:54,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:54,651 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:08:54,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:54,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 00:08:54,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:08:54,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:08:54,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:08:54,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:08:54,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:08:54,753 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 8 states. [2018-01-30 00:08:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:54,797 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-01-30 00:08:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:08:54,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-30 00:08:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:54,798 INFO L225 Difference]: With dead ends: 91 [2018-01-30 00:08:54,798 INFO L226 Difference]: Without dead ends: 80 [2018-01-30 00:08:54,798 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:08:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-30 00:08:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-30 00:08:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-30 00:08:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-01-30 00:08:54,810 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 63 [2018-01-30 00:08:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:54,810 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-01-30 00:08:54,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:08:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-01-30 00:08:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:08:54,811 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:54,811 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:54,811 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1424216055, now seen corresponding path program 1 times [2018-01-30 00:08:54,812 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:54,812 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:54,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:54,813 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:54,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:54,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-30 00:08:54,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:08:54,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:08:54,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:08:54,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:08:54,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:08:54,911 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 10 states. [2018-01-30 00:08:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:54,987 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-01-30 00:08:54,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:08:54,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2018-01-30 00:08:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:54,989 INFO L225 Difference]: With dead ends: 93 [2018-01-30 00:08:54,990 INFO L226 Difference]: Without dead ends: 80 [2018-01-30 00:08:54,990 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:08:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-30 00:08:55,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-30 00:08:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-30 00:08:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-01-30 00:08:55,003 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 68 [2018-01-30 00:08:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:55,003 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-01-30 00:08:55,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:08:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-01-30 00:08:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-30 00:08:55,004 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:55,005 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:55,005 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:55,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2116538207, now seen corresponding path program 1 times [2018-01-30 00:08:55,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:55,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:55,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:55,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:55,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:55,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:55,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:08:55,150 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:08:55,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:55,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:08:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:55,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:08:55,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-30 00:08:55,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:08:55,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:08:55,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:08:55,229 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 10 states. [2018-01-30 00:08:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:55,275 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-01-30 00:08:55,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:08:55,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-01-30 00:08:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:55,276 INFO L225 Difference]: With dead ends: 120 [2018-01-30 00:08:55,276 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 00:08:55,276 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:08:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 00:08:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-01-30 00:08:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 00:08:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-01-30 00:08:55,286 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 79 [2018-01-30 00:08:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:55,286 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-01-30 00:08:55,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:08:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-01-30 00:08:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-30 00:08:55,287 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:55,287 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:55,287 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:55,287 INFO L82 PathProgramCache]: Analyzing trace with hash -648140257, now seen corresponding path program 2 times [2018-01-30 00:08:55,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:55,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:55,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:55,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:08:55,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:55,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:55,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:08:55,410 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:08:55,416 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:08:55,443 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:55,455 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:55,456 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:08:55,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:08:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:55,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:08:55,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-30 00:08:55,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:08:55,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:08:55,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:08:55,497 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 11 states. [2018-01-30 00:08:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:55,583 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-01-30 00:08:55,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:08:55,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-01-30 00:08:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:55,584 INFO L225 Difference]: With dead ends: 124 [2018-01-30 00:08:55,584 INFO L226 Difference]: Without dead ends: 91 [2018-01-30 00:08:55,584 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:08:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-30 00:08:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-01-30 00:08:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-30 00:08:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-01-30 00:08:55,593 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 83 [2018-01-30 00:08:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:55,593 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-01-30 00:08:55,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:08:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-01-30 00:08:55,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-30 00:08:55,594 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:55,594 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:55,594 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:55,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1573964643, now seen corresponding path program 3 times [2018-01-30 00:08:55,594 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:55,594 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:55,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:55,595 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:08:55,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:55,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:55,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:08:55,773 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:08:55,781 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:08:55,813 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:08:55,828 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:08:55,844 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:08:55,892 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:08:56,064 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:08:56,222 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:08:56,305 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:08:56,343 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:08:56,345 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:08:56,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:08:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:56,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:08:56,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-01-30 00:08:56,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 00:08:56,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 00:08:56,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2018-01-30 00:08:56,524 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 25 states. [2018-01-30 00:08:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:56,699 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-01-30 00:08:56,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:08:56,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2018-01-30 00:08:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:56,700 INFO L225 Difference]: With dead ends: 128 [2018-01-30 00:08:56,700 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 00:08:56,701 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:08:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 00:08:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-01-30 00:08:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-30 00:08:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-01-30 00:08:56,711 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 87 [2018-01-30 00:08:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:56,711 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-01-30 00:08:56,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 00:08:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-01-30 00:08:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-30 00:08:56,712 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:56,712 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:56,712 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:56,713 INFO L82 PathProgramCache]: Analyzing trace with hash 777703451, now seen corresponding path program 4 times [2018-01-30 00:08:56,713 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:56,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:56,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:56,714 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:08:56,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:56,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:56,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:08:56,831 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:08:56,836 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:08:56,890 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:08:56,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:08:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:56,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:08:56,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-01-30 00:08:56,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:08:56,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:08:56,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:08:56,959 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 13 states. [2018-01-30 00:08:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:57,038 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-01-30 00:08:57,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:08:57,038 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2018-01-30 00:08:57,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:57,039 INFO L225 Difference]: With dead ends: 132 [2018-01-30 00:08:57,039 INFO L226 Difference]: Without dead ends: 99 [2018-01-30 00:08:57,040 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:08:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-30 00:08:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-01-30 00:08:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-30 00:08:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-01-30 00:08:57,051 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 91 [2018-01-30 00:08:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:57,051 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-01-30 00:08:57,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:08:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-01-30 00:08:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-30 00:08:57,052 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:57,052 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:57,052 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:57,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1009810585, now seen corresponding path program 5 times [2018-01-30 00:08:57,053 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:57,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:57,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:57,054 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:08:57,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:57,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:57,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:08:57,205 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:08:57,210 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:08:57,221 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:57,223 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:57,225 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:57,230 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:57,237 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:57,245 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:57,267 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:57,356 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:57,490 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:57,553 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:08:57,556 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:08:57,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:08:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:57,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:08:57,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-01-30 00:08:57,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 00:08:57,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 00:08:57,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:08:57,596 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 14 states. [2018-01-30 00:08:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:08:57,667 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-01-30 00:08:57,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:08:57,667 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2018-01-30 00:08:57,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:08:57,668 INFO L225 Difference]: With dead ends: 136 [2018-01-30 00:08:57,668 INFO L226 Difference]: Without dead ends: 103 [2018-01-30 00:08:57,668 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:08:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-30 00:08:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-01-30 00:08:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-30 00:08:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-01-30 00:08:57,678 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 95 [2018-01-30 00:08:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:08:57,678 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-01-30 00:08:57,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 00:08:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-01-30 00:08:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-30 00:08:57,679 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:08:57,679 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:08:57,679 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:08:57,679 INFO L82 PathProgramCache]: Analyzing trace with hash -700466665, now seen corresponding path program 6 times [2018-01-30 00:08:57,680 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:08:57,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:08:57,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:57,681 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:08:57,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:08:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:08:57,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:08:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:08:57,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:08:57,995 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:08:58,002 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 00:08:58,026 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:08:58,041 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:08:58,053 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:08:58,097 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:08:58,213 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:08:58,381 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:08:59,095 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:09:00,592 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:09:01,699 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:09:02,752 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:09:04,663 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 00:09:04,665 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:09:04,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:09:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:04,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:09:04,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-30 00:09:04,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 00:09:04,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 00:09:04,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:09:04,708 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 15 states. [2018-01-30 00:09:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:04,780 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-01-30 00:09:04,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:09:04,780 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-01-30 00:09:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:04,781 INFO L225 Difference]: With dead ends: 140 [2018-01-30 00:09:04,781 INFO L226 Difference]: Without dead ends: 107 [2018-01-30 00:09:04,781 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:09:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-30 00:09:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-01-30 00:09:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-30 00:09:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-01-30 00:09:04,793 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 99 [2018-01-30 00:09:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:04,793 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-01-30 00:09:04,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 00:09:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-01-30 00:09:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-30 00:09:04,794 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:04,794 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:04,794 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:09:04,794 INFO L82 PathProgramCache]: Analyzing trace with hash 861407381, now seen corresponding path program 7 times [2018-01-30 00:09:04,794 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:04,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:04,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:04,795 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:09:04,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:04,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:05,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:09:05,047 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:09:05,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:05,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:09:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:05,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:09:05,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-01-30 00:09:05,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:09:05,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:09:05,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:09:05,116 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 16 states. [2018-01-30 00:09:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:05,197 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-01-30 00:09:05,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 00:09:05,198 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-01-30 00:09:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:05,198 INFO L225 Difference]: With dead ends: 144 [2018-01-30 00:09:05,198 INFO L226 Difference]: Without dead ends: 111 [2018-01-30 00:09:05,199 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:09:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-30 00:09:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-01-30 00:09:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-30 00:09:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-01-30 00:09:05,209 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 103 [2018-01-30 00:09:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:05,209 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-01-30 00:09:05,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:09:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-01-30 00:09:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-30 00:09:05,210 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:05,210 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:05,210 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:09:05,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1769412589, now seen corresponding path program 8 times [2018-01-30 00:09:05,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:05,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:05,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:05,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:09:05,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:05,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:05,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:09:05,382 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:09:05,387 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:09:05,412 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:05,426 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:05,428 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:09:05,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:09:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:05,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:09:05,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-30 00:09:05,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:09:05,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:09:05,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:09:05,467 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 17 states. [2018-01-30 00:09:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:05,557 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-01-30 00:09:05,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:09:05,557 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2018-01-30 00:09:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:05,558 INFO L225 Difference]: With dead ends: 148 [2018-01-30 00:09:05,558 INFO L226 Difference]: Without dead ends: 115 [2018-01-30 00:09:05,559 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:09:05,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-30 00:09:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-01-30 00:09:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 00:09:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-01-30 00:09:05,575 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 107 [2018-01-30 00:09:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:05,575 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-01-30 00:09:05,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:09:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-01-30 00:09:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-30 00:09:05,576 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:05,577 INFO L350 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:05,577 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:09:05,577 INFO L82 PathProgramCache]: Analyzing trace with hash 790747281, now seen corresponding path program 9 times [2018-01-30 00:09:05,577 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:05,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:05,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:05,578 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:09:05,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:05,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:05,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:09:05,806 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:09:05,814 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:09:05,841 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:05,851 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:05,865 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:05,930 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:06,003 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:06,220 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:06,315 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:06,465 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:06,947 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:07,138 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:07,406 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:07,783 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:08,580 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:08,828 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:09:08,830 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:09:08,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:09:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:09,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:09:09,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2018-01-30 00:09:09,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 00:09:09,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 00:09:09,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 00:09:09,073 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 37 states. [2018-01-30 00:09:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:09,251 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-01-30 00:09:09,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:09:09,251 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 111 [2018-01-30 00:09:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:09,252 INFO L225 Difference]: With dead ends: 152 [2018-01-30 00:09:09,252 INFO L226 Difference]: Without dead ends: 119 [2018-01-30 00:09:09,253 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=419, Invalid=1221, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:09:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-30 00:09:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-01-30 00:09:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-30 00:09:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-01-30 00:09:09,265 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 111 [2018-01-30 00:09:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:09,265 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-01-30 00:09:09,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 00:09:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-01-30 00:09:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-30 00:09:09,266 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:09,266 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:09,266 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:09:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash -122529265, now seen corresponding path program 10 times [2018-01-30 00:09:09,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:09,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:09,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:09,267 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:09:09,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:09,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:09,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:09:09,502 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:09:09,508 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 00:09:09,733 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:09:09,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:09:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:09,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:09:09,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-01-30 00:09:09,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 00:09:09,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 00:09:09,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-30 00:09:09,780 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 19 states. [2018-01-30 00:09:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:09,868 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-01-30 00:09:09,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:09:09,868 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 115 [2018-01-30 00:09:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:09,869 INFO L225 Difference]: With dead ends: 156 [2018-01-30 00:09:09,869 INFO L226 Difference]: Without dead ends: 123 [2018-01-30 00:09:09,870 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:09:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-30 00:09:09,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-01-30 00:09:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-30 00:09:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-01-30 00:09:09,883 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 115 [2018-01-30 00:09:09,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:09,883 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-01-30 00:09:09,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 00:09:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-01-30 00:09:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-30 00:09:09,884 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:09,884 INFO L350 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:09,884 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:09:09,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1693848435, now seen corresponding path program 11 times [2018-01-30 00:09:09,884 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:09,884 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:09,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:09,885 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:09:09,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:09:09,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:09:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:10,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:09:10,143 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:09:10,148 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 00:09:10,159 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,160 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,162 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,167 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,180 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,192 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,210 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,272 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,324 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,416 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,444 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,476 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,596 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,784 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:10,883 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:11,003 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:09:11,006 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:09:11,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:09:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:09:11,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:09:11,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-01-30 00:09:11,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 00:09:11,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 00:09:11,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:09:11,052 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 20 states. [2018-01-30 00:09:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:09:11,160 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-01-30 00:09:11,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 00:09:11,160 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2018-01-30 00:09:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:09:11,161 INFO L225 Difference]: With dead ends: 160 [2018-01-30 00:09:11,161 INFO L226 Difference]: Without dead ends: 127 [2018-01-30 00:09:11,162 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:09:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-30 00:09:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2018-01-30 00:09:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-30 00:09:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-01-30 00:09:11,175 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 119 [2018-01-30 00:09:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:09:11,176 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-01-30 00:09:11,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 00:09:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-01-30 00:09:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-30 00:09:11,177 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:09:11,177 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:09:11,177 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-30 00:09:11,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1245188107, now seen corresponding path program 12 times [2018-01-30 00:09:11,177 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:09:11,177 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:09:11,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:11,178 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:09:11,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:09:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:09:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:09:11,294 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 00:09:11,333 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-30 00:09:11,337 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-30 00:09:11,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:09:11 BoogieIcfgContainer [2018-01-30 00:09:11,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:09:11,356 INFO L168 Benchmark]: Toolchain (without parser) took 32209.54 ms. Allocated memory was 297.8 MB in the beginning and 608.2 MB in the end (delta: 310.4 MB). Free memory was 256.8 MB in the beginning and 572.6 MB in the end (delta: -315.8 MB). Peak memory consumption was 277.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:11,357 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 297.8 MB. Free memory is still 263.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:09:11,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.09 ms. Allocated memory is still 297.8 MB. Free memory was 256.8 MB in the beginning and 243.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:11,357 INFO L168 Benchmark]: Boogie Preprocessor took 32.84 ms. Allocated memory is still 297.8 MB. Free memory was 243.9 MB in the beginning and 241.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:11,357 INFO L168 Benchmark]: RCFGBuilder took 295.84 ms. Allocated memory is still 297.8 MB. Free memory was 241.9 MB in the beginning and 219.1 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:11,358 INFO L168 Benchmark]: TraceAbstraction took 31659.88 ms. Allocated memory was 297.8 MB in the beginning and 608.2 MB in the end (delta: 310.4 MB). Free memory was 219.1 MB in the beginning and 572.6 MB in the end (delta: -353.5 MB). Peak memory consumption was 239.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:09:11,360 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 297.8 MB. Free memory is still 263.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.09 ms. Allocated memory is still 297.8 MB. Free memory was 256.8 MB in the beginning and 243.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.84 ms. Allocated memory is still 297.8 MB. Free memory was 243.9 MB in the beginning and 241.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 295.84 ms. Allocated memory is still 297.8 MB. Free memory was 241.9 MB in the beginning and 219.1 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 31659.88 ms. Allocated memory was 297.8 MB in the beginning and 608.2 MB in the end (delta: 310.4 MB). Free memory was 219.1 MB in the beginning and 572.6 MB in the end (delta: -353.5 MB). Peak memory consumption was 239.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1441]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1441. Possible FailurePath: [L1442] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=16, __VERIFIER_nondet_int()=1, size=16] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={20:0}, size=16] [L1074] RET return malloc(size); VAL [\old(size)=16, \result={20:0}, malloc(size)={20:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={20:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) VAL [kobj={20:0}, ldv_malloc(sizeof(*kobj))={20:0}] [L1409] COND FALSE !(!kobj) VAL [kobj={20:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={20:0}, memset(kobj, 0, sizeof(*kobj))={20:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={20:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={20:0}, kobj={20:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={20:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={20:0}, kobj={20:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={20:12}] [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) VAL [kref={20:12}, kref={20:12}] [L1382] ldv_kref_init(&kobj->kref) VAL [kobj={20:0}, kobj={20:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [list={20:4}] [L1099] FCALL list->next = list VAL [list={20:4}, list={20:4}] [L1100] FCALL list->prev = list VAL [list={20:4}, list={20:4}] [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={20:0}, kobj={20:0}] [L1413] ldv_kobject_init(kobj) VAL [kobj={20:0}] [L1414] RET return kobj; VAL [\result={20:0}, kobj={20:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={20:0}] [L1437] RET kobj = ldv_kobject_create() VAL [kobj={20:0}, ldv_kobject_create()={20:0}] [L1442] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 77 locations, 9 error locations. UNSAFE Result, 31.5s OverallTime, 26 OverallIterations, 16 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1474 SDtfs, 758 SDslu, 10130 SDs, 0 SdLazy, 3101 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1596 GetRequests, 1259 SyntacticMatches, 1 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=25, 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.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 56 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 12.2s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 3105 NumberOfCodeBlocks, 3081 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 2942 ConstructedInterpolants, 75 QuantifiedInterpolants, 645449 SizeOfPredicates, 41 NumberOfNonLiveVariables, 3839 ConjunctsInSsa, 279 ConjunctsInUnsatCore, 40 InterpolantComputations, 12 PerfectInterpolantSequences, 139/4825 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-09-11-368.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-09-11-368.csv Received shutdown request...