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_test17_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:36:48,398 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:36:48,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:36:48,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:36:48,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:36:48,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:36:48,419 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:36:48,420 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:36:48,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:36:48,423 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:36:48,424 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:36:48,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:36:48,425 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:36:48,427 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:36:48,427 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:36:48,430 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:36:48,432 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:36:48,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:36:48,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:36:48,437 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:36:48,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:36:48,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:36:48,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:36:48,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:36:48,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:36:48,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:36:48,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:36:48,444 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:36:48,444 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:36:48,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:36:48,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:36:48,445 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-28 22:36:48,453 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:36:48,453 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:36:48,454 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:36:48,454 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:36:48,454 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:36:48,454 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:36:48,455 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:36:48,455 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:36:48,455 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:36:48,455 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:36:48,456 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:36:48,456 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:36:48,456 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:36:48,456 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:36:48,456 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:36:48,456 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:36:48,456 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:36:48,456 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:36:48,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:36:48,457 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:36:48,457 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:36:48,457 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:36:48,457 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:36:48,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:36:48,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:36:48,458 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:36:48,458 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:36:48,458 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:36:48,458 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:36:48,458 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:36:48,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:36:48,458 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:36:48,459 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:36:48,459 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:36:48,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:36:48,502 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:36:48,505 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:36:48,507 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:36:48,507 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:36:48,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-28 22:36:48,709 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:36:48,714 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:36:48,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:36:48,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:36:48,721 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:36:48,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:36:48" (1/1) ... [2018-01-28 22:36:48,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce495a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:48, skipping insertion in model container [2018-01-28 22:36:48,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:36:48" (1/1) ... [2018-01-28 22:36:48,739 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:36:48,787 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:36:48,909 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:36:48,933 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:36:48,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:48 WrapperNode [2018-01-28 22:36:48,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:36:48,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:36:48,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:36:48,944 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:36:48,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:48" (1/1) ... [2018-01-28 22:36:48,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:48" (1/1) ... [2018-01-28 22:36:48,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:48" (1/1) ... [2018-01-28 22:36:48,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:48" (1/1) ... [2018-01-28 22:36:48,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:48" (1/1) ... [2018-01-28 22:36:48,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:48" (1/1) ... [2018-01-28 22:36:48,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:48" (1/1) ... [2018-01-28 22:36:48,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:36:48,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:36:48,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:36:48,983 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:36:48,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:48" (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-28 22:36:49,038 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:36:49,039 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:36:49,039 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-01-28 22:36:49,039 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:36:49,039 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-28 22:36:49,039 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-28 22:36:49,039 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:36:49,039 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:36:49,039 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:36:49,040 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:36:49,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:36:49,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:36:49,040 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:36:49,040 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:36:49,040 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:36:49,040 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:36:49,040 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-01-28 22:36:49,040 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:36:49,040 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-28 22:36:49,040 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-28 22:36:49,041 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-28 22:36:49,041 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:36:49,041 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:36:49,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:36:49,041 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:36:49,335 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:36:49,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:36:49 BoogieIcfgContainer [2018-01-28 22:36:49,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:36:49,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:36:49,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:36:49,341 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:36:49,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:36:48" (1/3) ... [2018-01-28 22:36:49,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7f0aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:36:49, skipping insertion in model container [2018-01-28 22:36:49,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:36:48" (2/3) ... [2018-01-28 22:36:49,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7f0aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:36:49, skipping insertion in model container [2018-01-28 22:36:49,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:36:49" (3/3) ... [2018-01-28 22:36:49,344 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-28 22:36:49,351 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:36:49,358 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-28 22:36:49,397 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:36:49,397 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:36:49,397 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:36:49,397 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:36:49,397 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:36:49,397 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:36:49,397 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:36:49,397 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:36:49,398 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:36:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-01-28 22:36:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:36:49,423 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:49,424 INFO L330 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] [2018-01-28 22:36:49,424 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:49,428 INFO L82 PathProgramCache]: Analyzing trace with hash 807914669, now seen corresponding path program 1 times [2018-01-28 22:36:49,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:49,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:49,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:49,477 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:49,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:49,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:49,650 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-28 22:36:49,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:49,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:36:49,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:36:49,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:36:49,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:36:49,750 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 3 states. [2018-01-28 22:36:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:49,914 INFO L93 Difference]: Finished difference Result 251 states and 292 transitions. [2018-01-28 22:36:49,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:36:49,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-28 22:36:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:49,927 INFO L225 Difference]: With dead ends: 251 [2018-01-28 22:36:49,927 INFO L226 Difference]: Without dead ends: 166 [2018-01-28 22:36:49,930 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-28 22:36:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-28 22:36:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 115. [2018-01-28 22:36:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-28 22:36:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-01-28 22:36:49,976 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 34 [2018-01-28 22:36:49,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:49,977 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-01-28 22:36:49,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:36:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-01-28 22:36:49,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 22:36:49,979 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:49,979 INFO L330 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] [2018-01-28 22:36:49,979 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:49,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1388598547, now seen corresponding path program 1 times [2018-01-28 22:36:49,979 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:49,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:49,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:49,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:49,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:50,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:50,093 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-28 22:36:50,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:50,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:36:50,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:36:50,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:36:50,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:36:50,096 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 6 states. [2018-01-28 22:36:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:50,177 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2018-01-28 22:36:50,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:36:50,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-28 22:36:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:50,180 INFO L225 Difference]: With dead ends: 136 [2018-01-28 22:36:50,180 INFO L226 Difference]: Without dead ends: 132 [2018-01-28 22:36:50,181 INFO L533 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-28 22:36:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-28 22:36:50,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 110. [2018-01-28 22:36:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-28 22:36:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-01-28 22:36:50,194 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 35 [2018-01-28 22:36:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:50,195 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-01-28 22:36:50,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:36:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-01-28 22:36:50,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 22:36:50,196 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:50,196 INFO L330 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] [2018-01-28 22:36:50,196 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:50,197 INFO L82 PathProgramCache]: Analyzing trace with hash -752147610, now seen corresponding path program 1 times [2018-01-28 22:36:50,197 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:50,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:50,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:50,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:50,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:50,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:50,279 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-28 22:36:50,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:50,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:36:50,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:36:50,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:36:50,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:36:50,280 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 5 states. [2018-01-28 22:36:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:50,353 INFO L93 Difference]: Finished difference Result 200 states and 213 transitions. [2018-01-28 22:36:50,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:36:50,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-28 22:36:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:50,355 INFO L225 Difference]: With dead ends: 200 [2018-01-28 22:36:50,356 INFO L226 Difference]: Without dead ends: 112 [2018-01-28 22:36:50,357 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:36:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-28 22:36:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-28 22:36:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 22:36:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-28 22:36:50,367 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 35 [2018-01-28 22:36:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:50,368 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-28 22:36:50,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:36:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-28 22:36:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 22:36:50,369 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:50,370 INFO L330 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] [2018-01-28 22:36:50,370 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:50,370 INFO L82 PathProgramCache]: Analyzing trace with hash -124580570, now seen corresponding path program 1 times [2018-01-28 22:36:50,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:50,370 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:50,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:50,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:50,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:50,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:50,437 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-28 22:36:50,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:50,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:36:50,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:36:50,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:36:50,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:36:50,438 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 6 states. [2018-01-28 22:36:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:50,600 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-01-28 22:36:50,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:36:50,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-28 22:36:50,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:50,603 INFO L225 Difference]: With dead ends: 112 [2018-01-28 22:36:50,603 INFO L226 Difference]: Without dead ends: 111 [2018-01-28 22:36:50,604 INFO L533 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-28 22:36:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-28 22:36:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-01-28 22:36:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-28 22:36:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-01-28 22:36:50,614 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 36 [2018-01-28 22:36:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:50,615 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-01-28 22:36:50,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:36:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-01-28 22:36:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 22:36:50,616 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:50,616 INFO L330 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] [2018-01-28 22:36:50,616 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash -124580569, now seen corresponding path program 1 times [2018-01-28 22:36:50,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:50,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:50,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:50,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:50,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:50,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:51,015 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-28 22:36:51,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:51,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-28 22:36:51,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:36:51,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:36:51,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:36:51,017 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 13 states. [2018-01-28 22:36:51,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:51,464 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-01-28 22:36:51,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:36:51,464 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-01-28 22:36:51,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:51,465 INFO L225 Difference]: With dead ends: 197 [2018-01-28 22:36:51,465 INFO L226 Difference]: Without dead ends: 118 [2018-01-28 22:36:51,466 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:36:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-28 22:36:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-01-28 22:36:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-28 22:36:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-01-28 22:36:51,477 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 36 [2018-01-28 22:36:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:51,478 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-01-28 22:36:51,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:36:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-01-28 22:36:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 22:36:51,479 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:51,479 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 22:36:51,479 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:51,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1474274973, now seen corresponding path program 1 times [2018-01-28 22:36:51,480 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:51,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:51,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:51,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:51,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:51,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:51,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:51,857 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-28 22:36:51,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:51,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:52,020 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-28 22:36:52,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:52,037 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-28 22:36:52,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:52,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:36:52,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-28 22:36:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:52,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:52,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-01-28 22:36:52,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-28 22:36:52,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-28 22:36:52,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2018-01-28 22:36:52,566 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 23 states. [2018-01-28 22:36:53,319 WARN L146 SmtUtils]: Spent 333ms on a formula simplification. DAG size of input: 27 DAG size of output 25 [2018-01-28 22:36:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:53,460 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-28 22:36:53,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:36:53,460 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-01-28 22:36:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:53,461 INFO L225 Difference]: With dead ends: 117 [2018-01-28 22:36:53,461 INFO L226 Difference]: Without dead ends: 116 [2018-01-28 22:36:53,462 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2018-01-28 22:36:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-28 22:36:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-01-28 22:36:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 22:36:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-28 22:36:53,471 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 42 [2018-01-28 22:36:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:53,472 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-28 22:36:53,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-28 22:36:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-28 22:36:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 22:36:53,473 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:53,473 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:53,474 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1536057818, now seen corresponding path program 1 times [2018-01-28 22:36:53,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:53,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:53,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:53,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:53,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:53,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:36:53,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:53,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:36:53,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:36:53,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:36:53,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:36:53,584 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 5 states. [2018-01-28 22:36:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:53,645 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2018-01-28 22:36:53,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:36:53,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-01-28 22:36:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:53,646 INFO L225 Difference]: With dead ends: 189 [2018-01-28 22:36:53,646 INFO L226 Difference]: Without dead ends: 117 [2018-01-28 22:36:53,647 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:36:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-28 22:36:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-01-28 22:36:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-28 22:36:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-01-28 22:36:53,653 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 61 [2018-01-28 22:36:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:53,654 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-01-28 22:36:53,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:36:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-01-28 22:36:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 22:36:53,655 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:53,656 INFO L330 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:53,656 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:53,656 INFO L82 PathProgramCache]: Analyzing trace with hash 429771204, now seen corresponding path program 1 times [2018-01-28 22:36:53,656 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:53,656 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:53,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:53,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:53,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:53,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:53,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:53,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:36:53,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:36:53,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:36:53,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:36:53,732 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 6 states. [2018-01-28 22:36:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:53,892 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2018-01-28 22:36:53,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:36:53,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-01-28 22:36:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:53,893 INFO L225 Difference]: With dead ends: 165 [2018-01-28 22:36:53,893 INFO L226 Difference]: Without dead ends: 163 [2018-01-28 22:36:53,894 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:36:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-28 22:36:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2018-01-28 22:36:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-28 22:36:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2018-01-28 22:36:53,904 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 62 [2018-01-28 22:36:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:53,904 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2018-01-28 22:36:53,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:36:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2018-01-28 22:36:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 22:36:53,906 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:53,906 INFO L330 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:53,906 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:53,906 INFO L82 PathProgramCache]: Analyzing trace with hash 429771205, now seen corresponding path program 1 times [2018-01-28 22:36:53,906 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:53,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:53,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:53,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:53,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:53,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:54,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:36:54,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:36:54,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:36:54,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:36:54,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-28 22:36:54,039 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand 11 states. [2018-01-28 22:36:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:54,208 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2018-01-28 22:36:54,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 22:36:54,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-01-28 22:36:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:54,211 INFO L225 Difference]: With dead ends: 208 [2018-01-28 22:36:54,211 INFO L226 Difference]: Without dead ends: 171 [2018-01-28 22:36:54,211 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:36:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-28 22:36:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 143. [2018-01-28 22:36:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-28 22:36:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-01-28 22:36:54,222 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 62 [2018-01-28 22:36:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:54,223 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-01-28 22:36:54,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:36:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-01-28 22:36:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 22:36:54,224 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:54,224 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:54,224 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:54,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1731911702, now seen corresponding path program 1 times [2018-01-28 22:36:54,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:54,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:54,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:54,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:54,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:54,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 22:36:54,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:54,404 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-28 22:36:54,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:54,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:54,447 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 6 treesize of output 5 [2018-01-28 22:36:54,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:54,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:36:54,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:36:54,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:54,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:54,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-28 22:36:54,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:54,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:36:54,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-28 22:36:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 22:36:54,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:54,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-01-28 22:36:54,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:36:54,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:36:54,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:36:54,559 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 13 states. [2018-01-28 22:36:55,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:36:55,028 INFO L93 Difference]: Finished difference Result 195 states and 221 transitions. [2018-01-28 22:36:55,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 22:36:55,060 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-01-28 22:36:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:36:55,062 INFO L225 Difference]: With dead ends: 195 [2018-01-28 22:36:55,062 INFO L226 Difference]: Without dead ends: 192 [2018-01-28 22:36:55,063 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-01-28 22:36:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-28 22:36:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 149. [2018-01-28 22:36:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-28 22:36:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2018-01-28 22:36:55,077 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 62 [2018-01-28 22:36:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:36:55,077 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2018-01-28 22:36:55,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:36:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2018-01-28 22:36:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 22:36:55,078 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:36:55,078 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:36:55,078 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:36:55,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1731911703, now seen corresponding path program 1 times [2018-01-28 22:36:55,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:36:55,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:36:55,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:55,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:55,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:36:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:55,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:36:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:55,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:36:55,419 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-28 22:36:55,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:36:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:36:55,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:36:55,477 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 23 treesize of output 22 [2018-01-28 22:36:55,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:55,496 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-28 22:36:55,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:55,516 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 19 treesize of output 18 [2018-01-28 22:36:55,517 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:55,519 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 22 treesize of output 21 [2018-01-28 22:36:55,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:55,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:36:55,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-28 22:36:56,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:56,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:56,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2018-01-28 22:36:56,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:56,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:56,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:56,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-01-28 22:36:56,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:56,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:56,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-01-28 22:36:56,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:56,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:56,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:36:56,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-01-28 22:36:56,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:36:56,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-28 22:36:56,238 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:101, output treesize:83 [2018-01-28 22:36:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:36:56,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:36:56,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-28 22:36:56,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 22:36:56,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 22:36:56,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=543, Unknown=1, NotChecked=0, Total=600 [2018-01-28 22:36:56,404 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 25 states. [2018-01-28 22:36:58,680 WARN L146 SmtUtils]: Spent 2089ms on a formula simplification. DAG size of input: 60 DAG size of output 56 [2018-01-28 22:37:00,893 WARN L146 SmtUtils]: Spent 2131ms on a formula simplification. DAG size of input: 77 DAG size of output 72 [2018-01-28 22:37:07,177 WARN L146 SmtUtils]: Spent 6106ms on a formula simplification. DAG size of input: 69 DAG size of output 68 [2018-01-28 22:37:11,261 WARN L146 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 52 DAG size of output 52 [2018-01-28 22:37:13,369 WARN L146 SmtUtils]: Spent 2063ms on a formula simplification. DAG size of input: 54 DAG size of output 54 [2018-01-28 22:37:13,664 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 59 DAG size of output 47 [2018-01-28 22:37:41,106 WARN L146 SmtUtils]: Spent 20746ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-01-28 22:38:03,459 WARN L146 SmtUtils]: Spent 22286ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-01-28 22:38:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:04,002 INFO L93 Difference]: Finished difference Result 255 states and 280 transitions. [2018-01-28 22:38:04,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 22:38:04,002 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-01-28 22:38:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:04,004 INFO L225 Difference]: With dead ends: 255 [2018-01-28 22:38:04,004 INFO L226 Difference]: Without dead ends: 254 [2018-01-28 22:38:04,005 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 61.2s TimeCoverageRelationStatistics Valid=192, Invalid=1444, Unknown=4, NotChecked=0, Total=1640 [2018-01-28 22:38:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-01-28 22:38:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 153. [2018-01-28 22:38:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-28 22:38:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2018-01-28 22:38:04,023 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 62 [2018-01-28 22:38:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:04,024 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2018-01-28 22:38:04,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 22:38:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2018-01-28 22:38:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-28 22:38:04,025 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:04,025 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:38:04,025 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:04,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2118368878, now seen corresponding path program 1 times [2018-01-28 22:38:04,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:04,026 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:04,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:04,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:04,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:04,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:38:04,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:04,207 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-28 22:38:04,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:04,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-28 22:38:04,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:38:04,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 10 [2018-01-28 22:38:04,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:38:04,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:38:04,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:38:04,269 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 10 states. [2018-01-28 22:38:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:04,504 INFO L93 Difference]: Finished difference Result 276 states and 312 transitions. [2018-01-28 22:38:04,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 22:38:04,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2018-01-28 22:38:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:04,507 INFO L225 Difference]: With dead ends: 276 [2018-01-28 22:38:04,507 INFO L226 Difference]: Without dead ends: 228 [2018-01-28 22:38:04,508 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:38:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-01-28 22:38:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 204. [2018-01-28 22:38:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-28 22:38:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2018-01-28 22:38:04,543 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 64 [2018-01-28 22:38:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:04,543 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2018-01-28 22:38:04,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:38:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2018-01-28 22:38:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-28 22:38:04,545 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:04,545 INFO L330 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, 1, 1, 1, 1, 1, 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-28 22:38:04,545 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:04,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1181630033, now seen corresponding path program 1 times [2018-01-28 22:38:04,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:04,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:04,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:04,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:04,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:04,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:04,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:04,748 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-28 22:38:04,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:04,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:04,807 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 14 treesize of output 13 [2018-01-28 22:38:04,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:04,825 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-28 22:38:04,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:04,839 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-28 22:38:04,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-28 22:38:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:07,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:07,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-01-28 22:38:07,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 22:38:07,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 22:38:07,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=337, Unknown=1, NotChecked=0, Total=380 [2018-01-28 22:38:07,558 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand 20 states. [2018-01-28 22:38:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:22,970 INFO L93 Difference]: Finished difference Result 230 states and 255 transitions. [2018-01-28 22:38:22,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:38:22,970 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 76 [2018-01-28 22:38:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:22,972 INFO L225 Difference]: With dead ends: 230 [2018-01-28 22:38:22,972 INFO L226 Difference]: Without dead ends: 229 [2018-01-28 22:38:22,973 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=120, Invalid=871, Unknown=1, NotChecked=0, Total=992 [2018-01-28 22:38:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-28 22:38:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 214. [2018-01-28 22:38:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-28 22:38:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 243 transitions. [2018-01-28 22:38:23,003 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 243 transitions. Word has length 76 [2018-01-28 22:38:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:23,004 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 243 transitions. [2018-01-28 22:38:23,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 22:38:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 243 transitions. [2018-01-28 22:38:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-28 22:38:23,005 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:23,005 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:38:23,005 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1841193406, now seen corresponding path program 1 times [2018-01-28 22:38:23,006 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:23,006 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:23,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:23,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:23,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:23,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-28 22:38:23,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:38:23,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:38:23,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:38:23,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:38:23,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:38:23,096 INFO L87 Difference]: Start difference. First operand 214 states and 243 transitions. Second operand 6 states. [2018-01-28 22:38:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:23,173 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2018-01-28 22:38:23,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:38:23,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-01-28 22:38:23,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:23,176 INFO L225 Difference]: With dead ends: 282 [2018-01-28 22:38:23,176 INFO L226 Difference]: Without dead ends: 215 [2018-01-28 22:38:23,176 INFO L533 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-28 22:38:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-01-28 22:38:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2018-01-28 22:38:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-28 22:38:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 236 transitions. [2018-01-28 22:38:23,208 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 236 transitions. Word has length 77 [2018-01-28 22:38:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:23,209 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 236 transitions. [2018-01-28 22:38:23,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:38:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 236 transitions. [2018-01-28 22:38:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-28 22:38:23,210 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:23,210 INFO L330 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, 1, 1, 1, 1, 1, 1, 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-28 22:38:23,210 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2024174689, now seen corresponding path program 1 times [2018-01-28 22:38:23,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:23,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:23,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:23,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:23,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:23,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:38:23,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:23,527 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-28 22:38:23,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:23,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:23,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:38:23,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:38:23,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:23,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:23,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:23,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-28 22:38:23,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 22:38:23,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 22:38:23,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:23,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:23,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:23,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-28 22:38:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:38:23,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:23,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2018-01-28 22:38:23,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 22:38:23,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 22:38:23,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-01-28 22:38:23,709 INFO L87 Difference]: Start difference. First operand 211 states and 236 transitions. Second operand 19 states. [2018-01-28 22:38:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:24,207 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2018-01-28 22:38:24,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 22:38:24,208 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-01-28 22:38:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:24,209 INFO L225 Difference]: With dead ends: 226 [2018-01-28 22:38:24,209 INFO L226 Difference]: Without dead ends: 225 [2018-01-28 22:38:24,209 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2018-01-28 22:38:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-28 22:38:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 212. [2018-01-28 22:38:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-28 22:38:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 238 transitions. [2018-01-28 22:38:24,241 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 238 transitions. Word has length 77 [2018-01-28 22:38:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:24,241 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 238 transitions. [2018-01-28 22:38:24,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 22:38:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 238 transitions. [2018-01-28 22:38:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-28 22:38:24,242 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:24,243 INFO L330 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, 1, 1, 1, 1, 1, 1, 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-28 22:38:24,243 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2024174690, now seen corresponding path program 1 times [2018-01-28 22:38:24,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:24,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:24,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:24,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:24,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:24,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:38:24,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:24,448 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-28 22:38:24,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:24,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:24,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:38:24,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:38:24,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:24,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:24,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:24,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-28 22:38:24,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 22:38:24,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 22:38:24,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:24,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:24,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:24,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-28 22:38:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:38:24,695 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:24,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2018-01-28 22:38:24,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 22:38:24,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 22:38:24,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-01-28 22:38:24,697 INFO L87 Difference]: Start difference. First operand 212 states and 238 transitions. Second operand 19 states. [2018-01-28 22:38:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:25,444 INFO L93 Difference]: Finished difference Result 225 states and 246 transitions. [2018-01-28 22:38:25,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:38:25,444 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-01-28 22:38:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:25,445 INFO L225 Difference]: With dead ends: 225 [2018-01-28 22:38:25,445 INFO L226 Difference]: Without dead ends: 224 [2018-01-28 22:38:25,446 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2018-01-28 22:38:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-28 22:38:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2018-01-28 22:38:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-28 22:38:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 237 transitions. [2018-01-28 22:38:25,466 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 237 transitions. Word has length 77 [2018-01-28 22:38:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:25,467 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 237 transitions. [2018-01-28 22:38:25,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 22:38:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 237 transitions. [2018-01-28 22:38:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-28 22:38:25,468 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:25,468 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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-28 22:38:25,468 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1195867586, now seen corresponding path program 1 times [2018-01-28 22:38:25,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:25,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:25,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:25,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:25,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:25,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-28 22:38:25,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:25,581 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-28 22:38:25,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:25,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-28 22:38:25,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:25,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-28 22:38:25,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:38:25,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:38:25,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:38:25,800 INFO L87 Difference]: Start difference. First operand 212 states and 237 transitions. Second operand 7 states. [2018-01-28 22:38:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:26,446 INFO L93 Difference]: Finished difference Result 238 states and 265 transitions. [2018-01-28 22:38:26,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:38:26,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2018-01-28 22:38:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:26,448 INFO L225 Difference]: With dead ends: 238 [2018-01-28 22:38:26,448 INFO L226 Difference]: Without dead ends: 236 [2018-01-28 22:38:26,448 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:38:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-28 22:38:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 223. [2018-01-28 22:38:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-28 22:38:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2018-01-28 22:38:26,471 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 80 [2018-01-28 22:38:26,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:26,472 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2018-01-28 22:38:26,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:38:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2018-01-28 22:38:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-28 22:38:26,473 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:26,473 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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-28 22:38:26,473 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1195867587, now seen corresponding path program 1 times [2018-01-28 22:38:26,473 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:26,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:26,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:26,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:26,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:26,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:38:26,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:26,792 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-28 22:38:26,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:26,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:38:27,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:27,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 26 [2018-01-28 22:38:27,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 22:38:27,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 22:38:27,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-01-28 22:38:27,060 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand 27 states. [2018-01-28 22:38:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:28,104 INFO L93 Difference]: Finished difference Result 320 states and 358 transitions. [2018-01-28 22:38:28,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-28 22:38:28,104 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2018-01-28 22:38:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:28,106 INFO L225 Difference]: With dead ends: 320 [2018-01-28 22:38:28,106 INFO L226 Difference]: Without dead ends: 319 [2018-01-28 22:38:28,107 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=1854, Unknown=0, NotChecked=0, Total=2070 [2018-01-28 22:38:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-28 22:38:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 233. [2018-01-28 22:38:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-01-28 22:38:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 262 transitions. [2018-01-28 22:38:28,144 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 262 transitions. Word has length 80 [2018-01-28 22:38:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:28,145 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 262 transitions. [2018-01-28 22:38:28,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 22:38:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 262 transitions. [2018-01-28 22:38:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-28 22:38:28,146 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:28,146 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-01-28 22:38:28,146 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:28,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1796959211, now seen corresponding path program 1 times [2018-01-28 22:38:28,147 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:28,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:28,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:28,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:28,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:28,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-28 22:38:28,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:28,307 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-28 22:38:28,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:28,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:38:28,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:28,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-01-28 22:38:28,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 22:38:28,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 22:38:28,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:38:28,483 INFO L87 Difference]: Start difference. First operand 233 states and 262 transitions. Second operand 16 states. [2018-01-28 22:38:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:28,682 INFO L93 Difference]: Finished difference Result 324 states and 363 transitions. [2018-01-28 22:38:28,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 22:38:28,682 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-01-28 22:38:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:28,683 INFO L225 Difference]: With dead ends: 324 [2018-01-28 22:38:28,683 INFO L226 Difference]: Without dead ends: 235 [2018-01-28 22:38:28,684 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:38:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-01-28 22:38:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 219. [2018-01-28 22:38:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-28 22:38:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 244 transitions. [2018-01-28 22:38:28,714 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 244 transitions. Word has length 80 [2018-01-28 22:38:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:28,714 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 244 transitions. [2018-01-28 22:38:28,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 22:38:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 244 transitions. [2018-01-28 22:38:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-28 22:38:28,716 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:28,716 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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-28 22:38:28,716 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:28,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1582810419, now seen corresponding path program 1 times [2018-01-28 22:38:28,716 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:28,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:28,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:28,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:28,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:28,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:38:29,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:29,601 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-28 22:38:29,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:29,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:29,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:38:29,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:38:29,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:29,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:29,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:29,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-28 22:38:29,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 22:38:29,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 22:38:29,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:29,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:29,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:29,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-28 22:38:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-28 22:38:29,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:29,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 32 [2018-01-28 22:38:29,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 22:38:29,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 22:38:29,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:38:29,867 INFO L87 Difference]: Start difference. First operand 219 states and 244 transitions. Second operand 33 states. [2018-01-28 22:38:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:31,100 INFO L93 Difference]: Finished difference Result 385 states and 434 transitions. [2018-01-28 22:38:31,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-28 22:38:31,101 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 81 [2018-01-28 22:38:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:31,102 INFO L225 Difference]: With dead ends: 385 [2018-01-28 22:38:31,103 INFO L226 Difference]: Without dead ends: 384 [2018-01-28 22:38:31,104 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=459, Invalid=3701, Unknown=0, NotChecked=0, Total=4160 [2018-01-28 22:38:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-01-28 22:38:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 338. [2018-01-28 22:38:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-01-28 22:38:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 399 transitions. [2018-01-28 22:38:31,137 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 399 transitions. Word has length 81 [2018-01-28 22:38:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:31,137 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 399 transitions. [2018-01-28 22:38:31,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 22:38:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 399 transitions. [2018-01-28 22:38:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-28 22:38:31,138 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:31,138 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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-28 22:38:31,139 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:31,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1582810418, now seen corresponding path program 1 times [2018-01-28 22:38:31,139 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:31,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:31,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:31,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:31,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:31,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-28 22:38:31,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:31,608 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-28 22:38:31,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:31,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:31,692 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 6 treesize of output 5 [2018-01-28 22:38:31,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:31,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:31,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:38:31,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:38:31,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:38:31,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:31,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:31,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:31,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-28 22:38:31,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-28 22:38:31,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-28 22:38:31,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:31,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:31,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:31,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-28 22:38:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-28 22:38:31,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:31,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 27 [2018-01-28 22:38:31,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-28 22:38:31,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-28 22:38:31,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-01-28 22:38:31,922 INFO L87 Difference]: Start difference. First operand 338 states and 399 transitions. Second operand 28 states. [2018-01-28 22:38:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:32,423 INFO L93 Difference]: Finished difference Result 356 states and 420 transitions. [2018-01-28 22:38:32,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 22:38:32,424 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2018-01-28 22:38:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:32,425 INFO L225 Difference]: With dead ends: 356 [2018-01-28 22:38:32,425 INFO L226 Difference]: Without dead ends: 355 [2018-01-28 22:38:32,426 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2018-01-28 22:38:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-28 22:38:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 329. [2018-01-28 22:38:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-01-28 22:38:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 387 transitions. [2018-01-28 22:38:32,476 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 387 transitions. Word has length 81 [2018-01-28 22:38:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:32,476 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 387 transitions. [2018-01-28 22:38:32,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-28 22:38:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 387 transitions. [2018-01-28 22:38:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-28 22:38:32,478 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:32,478 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:38:32,478 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:32,478 INFO L82 PathProgramCache]: Analyzing trace with hash -808392189, now seen corresponding path program 1 times [2018-01-28 22:38:32,478 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:32,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:32,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:32,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:32,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:32,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 22:38:32,596 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:32,596 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-28 22:38:32,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:32,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-28 22:38:32,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:38:32,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2018-01-28 22:38:32,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 22:38:32,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 22:38:32,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:38:32,709 INFO L87 Difference]: Start difference. First operand 329 states and 387 transitions. Second operand 16 states. [2018-01-28 22:38:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:32,868 INFO L93 Difference]: Finished difference Result 360 states and 419 transitions. [2018-01-28 22:38:32,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 22:38:32,869 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-01-28 22:38:32,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:32,871 INFO L225 Difference]: With dead ends: 360 [2018-01-28 22:38:32,871 INFO L226 Difference]: Without dead ends: 341 [2018-01-28 22:38:32,872 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-01-28 22:38:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-01-28 22:38:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 314. [2018-01-28 22:38:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-01-28 22:38:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 365 transitions. [2018-01-28 22:38:32,904 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 365 transitions. Word has length 81 [2018-01-28 22:38:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:32,905 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 365 transitions. [2018-01-28 22:38:32,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 22:38:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 365 transitions. [2018-01-28 22:38:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-28 22:38:32,906 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:32,906 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:38:32,906 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:32,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1959980701, now seen corresponding path program 1 times [2018-01-28 22:38:32,907 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:32,907 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:32,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:32,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:32,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:32,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:38:33,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:33,017 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-28 22:38:33,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:33,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-28 22:38:33,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:33,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-01-28 22:38:33,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 22:38:33,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 22:38:33,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:38:33,122 INFO L87 Difference]: Start difference. First operand 314 states and 365 transitions. Second operand 16 states. [2018-01-28 22:38:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:33,273 INFO L93 Difference]: Finished difference Result 338 states and 386 transitions. [2018-01-28 22:38:33,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 22:38:33,274 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 84 [2018-01-28 22:38:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:33,275 INFO L225 Difference]: With dead ends: 338 [2018-01-28 22:38:33,275 INFO L226 Difference]: Without dead ends: 319 [2018-01-28 22:38:33,276 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:38:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-28 22:38:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 312. [2018-01-28 22:38:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-01-28 22:38:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 359 transitions. [2018-01-28 22:38:33,306 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 359 transitions. Word has length 84 [2018-01-28 22:38:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:33,306 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 359 transitions. [2018-01-28 22:38:33,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 22:38:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 359 transitions. [2018-01-28 22:38:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-28 22:38:33,307 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:33,307 INFO L330 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 22:38:33,307 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:33,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1949147902, now seen corresponding path program 1 times [2018-01-28 22:38:33,308 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:33,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:33,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:33,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:33,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:33,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:33,823 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 31 DAG size of output 21 [2018-01-28 22:38:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:34,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:34,080 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-28 22:38:34,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:34,110 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:34,113 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 6 treesize of output 5 [2018-01-28 22:38:34,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:34,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:34,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:38:34,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:38:34,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:38:34,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:34,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:34,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:34,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-28 22:38:34,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-28 22:38:34,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:34,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:38:34,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:11 [2018-01-28 22:38:34,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-01-28 22:38:34,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-28 22:38:34,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:34,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-01-28 22:38:34,469 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:34,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-01-28 22:38:34,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:34,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:34,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:38:34,476 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:20, output treesize:5 [2018-01-28 22:38:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:38:34,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:34,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-01-28 22:38:34,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 22:38:34,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 22:38:34,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-01-28 22:38:34,516 INFO L87 Difference]: Start difference. First operand 312 states and 359 transitions. Second operand 26 states. [2018-01-28 22:38:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:38:35,388 INFO L93 Difference]: Finished difference Result 409 states and 476 transitions. [2018-01-28 22:38:35,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 22:38:35,388 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 86 [2018-01-28 22:38:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:38:35,390 INFO L225 Difference]: With dead ends: 409 [2018-01-28 22:38:35,390 INFO L226 Difference]: Without dead ends: 408 [2018-01-28 22:38:35,391 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=223, Invalid=1499, Unknown=0, NotChecked=0, Total=1722 [2018-01-28 22:38:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-01-28 22:38:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 349. [2018-01-28 22:38:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-01-28 22:38:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 397 transitions. [2018-01-28 22:38:35,447 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 397 transitions. Word has length 86 [2018-01-28 22:38:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:38:35,448 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 397 transitions. [2018-01-28 22:38:35,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 22:38:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 397 transitions. [2018-01-28 22:38:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-28 22:38:35,449 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:38:35,449 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-28 22:38:35,449 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-28 22:38:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1937156981, now seen corresponding path program 2 times [2018-01-28 22:38:35,450 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:38:35,450 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:38:35,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:35,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:38:35,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:38:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:38:35,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:38:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:38:35,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:38:35,910 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:38:35,917 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:38:35,931 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:38:35,941 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:38:35,944 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:38:35,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:38:35,951 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-28 22:38:35,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:35,963 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 23 treesize of output 22 [2018-01-28 22:38:35,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:35,965 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 19 treesize of output 18 [2018-01-28 22:38:35,965 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:35,977 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 22 treesize of output 21 [2018-01-28 22:38:35,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:35,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:38:35,988 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-28 22:38:36,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:36,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:36,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-01-28 22:38:36,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:36,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-01-28 22:38:36,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:36,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:36,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:36,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-01-28 22:38:36,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:36,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:36,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-01-28 22:38:36,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:36,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-28 22:38:36,938 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-28 22:38:37,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:37,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:37,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-01-28 22:38:37,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:37,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:37,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:37,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:37,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:37,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 100 [2018-01-28 22:38:37,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 22:38:37,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:37,766 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:37,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-28 22:38:37,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:37,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:37,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:37,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-01-28 22:38:37,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:37,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:37,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2018-01-28 22:38:37,934 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-28 22:38:38,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:38,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:38,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-01-28 22:38:38,112 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:38,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:38,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:38,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 90 [2018-01-28 22:38:38,291 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-28 22:38:38,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:38,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:38,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:38,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 92 [2018-01-28 22:38:38,518 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-28 22:38:38,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:38,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:38,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-01-28 22:38:38,765 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:38,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:38,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:38:38,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-28 22:38:38,768 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:38:38,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-1 vars, End of recursive call: 40 dim-0 vars, and 8 xjuncts. [2018-01-28 22:38:38,981 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 32 variables, input treesize:285, output treesize:437 [2018-01-28 22:38:39,276 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 239 DAG size of output 60 [2018-01-28 22:38:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-28 22:38:39,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:38:39,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-28 22:38:39,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-28 22:38:39,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-28 22:38:39,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1303, Unknown=5, NotChecked=0, Total=1406 [2018-01-28 22:38:39,352 INFO L87 Difference]: Start difference. First operand 349 states and 397 transitions. Second operand 38 states. [2018-01-28 22:38:41,651 WARN L146 SmtUtils]: Spent 2064ms on a formula simplification. DAG size of input: 59 DAG size of output 53 [2018-01-28 22:38:49,835 WARN L146 SmtUtils]: Spent 8131ms on a formula simplification. DAG size of input: 76 DAG size of output 67 [2018-01-28 22:38:54,127 WARN L146 SmtUtils]: Spent 4107ms on a formula simplification. DAG size of input: 68 DAG size of output 67 [2018-01-28 22:38:56,214 WARN L146 SmtUtils]: Spent 2047ms on a formula simplification. DAG size of input: 51 DAG size of output 51 [2018-01-28 22:38:58,338 WARN L146 SmtUtils]: Spent 2063ms on a formula simplification. DAG size of input: 58 DAG size of output 53 [2018-01-28 22:39:00,620 WARN L146 SmtUtils]: Spent 2063ms on a formula simplification. DAG size of input: 60 DAG size of output 55 Received shutdown request... [2018-01-28 22:39:12,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 22:39:12,343 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 22:39:12,346 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 22:39:12,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:39:12 BoogieIcfgContainer [2018-01-28 22:39:12,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:39:12,348 INFO L168 Benchmark]: Toolchain (without parser) took 143637.76 ms. Allocated memory was 306.2 MB in the beginning and 589.3 MB in the end (delta: 283.1 MB). Free memory was 265.2 MB in the beginning and 336.0 MB in the end (delta: -70.8 MB). Peak memory consumption was 212.3 MB. Max. memory is 5.3 GB. [2018-01-28 22:39:12,349 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:39:12,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.36 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 251.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:39:12,350 INFO L168 Benchmark]: Boogie Preprocessor took 38.94 ms. Allocated memory is still 306.2 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:39:12,350 INFO L168 Benchmark]: RCFGBuilder took 353.23 ms. Allocated memory is still 306.2 MB. Free memory was 249.3 MB in the beginning and 223.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-28 22:39:12,350 INFO L168 Benchmark]: TraceAbstraction took 143009.67 ms. Allocated memory was 306.2 MB in the beginning and 589.3 MB in the end (delta: 283.1 MB). Free memory was 222.7 MB in the beginning and 336.0 MB in the end (delta: -113.3 MB). Peak memory consumption was 169.8 MB. Max. memory is 5.3 GB. [2018-01-28 22:39:12,352 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.14 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.36 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 251.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.94 ms. Allocated memory is still 306.2 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 353.23 ms. Allocated memory is still 306.2 MB. Free memory was 249.3 MB in the beginning and 223.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 143009.67 ms. Allocated memory was 306.2 MB in the beginning and 589.3 MB in the end (delta: 283.1 MB). Free memory was 222.7 MB in the beginning and 336.0 MB in the end (delta: -113.3 MB). Peak memory consumption was 169.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1480). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 19 states, 38 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 82. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 113 locations, 17 error locations. TIMEOUT Result, 142.9s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 125.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2719 SDtfs, 3892 SDslu, 19459 SDs, 0 SdLazy, 10739 SolverSat, 507 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 31.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1703 GetRequests, 1117 SyntacticMatches, 24 SemanticMatches, 561 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3891 ImplicationChecksByTransitivity, 97.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=24, 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.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 621 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 2836 NumberOfCodeBlocks, 2836 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2795 ConstructedInterpolants, 155 QuantifiedInterpolants, 1265582 SizeOfPredicates, 125 NumberOfNonLiveVariables, 3200 ConjunctsInSsa, 354 ConjunctsInUnsatCore, 41 InterpolantComputations, 11 PerfectInterpolantSequences, 280/419 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-39-12-361.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-39-12-361.csv Completed graceful shutdown