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/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:21:48,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:21:48,372 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:21:48,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:21:48,393 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:21:48,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:21:48,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:21:48,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:21:48,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:21:48,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:21:48,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:21:48,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:21:48,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:21:48,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:21:48,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:21:48,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:21:48,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:21:48,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:21:48,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:21:48,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:21:48,428 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:21:48,428 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:21:48,429 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:21:48,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:21:48,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:21:48,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:21:48,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:21:48,440 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:21:48,440 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:21:48,440 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:21:48,441 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:21:48,441 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-31 08:21:48,453 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:21:48,453 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:21:48,454 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:21:48,455 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:21:48,456 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:21:48,456 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:21:48,456 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:21:48,457 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:21:48,457 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:21:48,457 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:21:48,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:21:48,457 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:21:48,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:21:48,458 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:21:48,458 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:21:48,458 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:21:48,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:21:48,458 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:21:48,459 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:21:48,459 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:21:48,460 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:21:48,460 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:21:48,460 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:21:48,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:21:48,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:21:48,461 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:21:48,461 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:21:48,461 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:21:48,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:21:48,462 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:21:48,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:21:48,462 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:21:48,463 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:21:48,463 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:21:48,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:21:48,528 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:21:48,533 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:21:48,535 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:21:48,535 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:21:48,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:21:48,794 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:21:48,803 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:21:48,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:21:48,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:21:48,812 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:21:48,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:21:48" (1/1) ... [2018-01-31 08:21:48,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b312c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:21:48, skipping insertion in model container [2018-01-31 08:21:48,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:21:48" (1/1) ... [2018-01-31 08:21:48,836 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:21:48,895 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:21:49,057 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:21:49,085 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:21:49,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:21:49 WrapperNode [2018-01-31 08:21:49,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:21:49,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:21:49,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:21:49,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:21:49,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:21:49" (1/1) ... [2018-01-31 08:21:49,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:21:49" (1/1) ... [2018-01-31 08:21:49,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:21:49" (1/1) ... [2018-01-31 08:21:49,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:21:49" (1/1) ... [2018-01-31 08:21:49,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:21:49" (1/1) ... [2018-01-31 08:21:49,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:21:49" (1/1) ... [2018-01-31 08:21:49,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:21:49" (1/1) ... [2018-01-31 08:21:49,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:21:49,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:21:49,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:21:49,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:21:49,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:21:49" (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-31 08:21:49,212 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:21:49,212 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:21:49,212 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-31 08:21:49,212 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:21:49,212 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:21:49,213 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:21:49,213 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:21:49,213 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:21:49,213 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:21:49,213 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:21:49,213 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-31 08:21:49,214 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:21:49,214 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:21:49,214 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:21:49,747 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:21:49,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:21:49 BoogieIcfgContainer [2018-01-31 08:21:49,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:21:49,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:21:49,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:21:49,752 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:21:49,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:21:48" (1/3) ... [2018-01-31 08:21:49,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64570812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:21:49, skipping insertion in model container [2018-01-31 08:21:49,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:21:49" (2/3) ... [2018-01-31 08:21:49,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64570812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:21:49, skipping insertion in model container [2018-01-31 08:21:49,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:21:49" (3/3) ... [2018-01-31 08:21:49,756 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:21:49,765 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:21:49,775 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 08:21:49,829 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:21:49,830 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:21:49,831 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:21:49,831 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:21:49,831 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:21:49,831 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:21:49,831 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:21:49,831 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:21:49,832 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:21:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-31 08:21:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:21:49,864 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:49,865 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:21:49,865 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash 486494336, now seen corresponding path program 1 times [2018-01-31 08:21:49,873 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:49,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:49,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:49,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:49,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:50,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:50,253 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-31 08:21:50,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:50,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:21:50,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:21:50,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:21:50,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:21:50,368 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2018-01-31 08:21:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:50,773 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-01-31 08:21:50,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:21:50,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-31 08:21:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:50,785 INFO L225 Difference]: With dead ends: 149 [2018-01-31 08:21:50,785 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 08:21:50,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:21:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 08:21:50,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-31 08:21:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 08:21:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-01-31 08:21:50,830 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2018-01-31 08:21:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:50,831 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-01-31 08:21:50,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:21:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-01-31 08:21:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:21:50,833 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:50,834 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:21:50,834 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash 486494337, now seen corresponding path program 1 times [2018-01-31 08:21:50,835 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:50,835 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:50,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:50,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:50,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:50,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:51,069 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-31 08:21:51,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:51,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:21:51,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:21:51,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:21:51,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:21:51,174 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 6 states. [2018-01-31 08:21:51,314 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-31 08:21:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:51,396 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-01-31 08:21:51,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:21:51,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-31 08:21:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:51,398 INFO L225 Difference]: With dead ends: 87 [2018-01-31 08:21:51,398 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 08:21:51,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:21:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 08:21:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-31 08:21:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 08:21:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-31 08:21:51,409 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 19 [2018-01-31 08:21:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:51,409 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-31 08:21:51,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:21:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-31 08:21:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:21:51,410 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:51,411 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:21:51,411 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:51,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2098544684, now seen corresponding path program 1 times [2018-01-31 08:21:51,411 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:51,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:51,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:51,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:51,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:51,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:51,498 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-31 08:21:51,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:51,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:21:51,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:21:51,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:21:51,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:21:51,500 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 4 states. [2018-01-31 08:21:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:51,577 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-31 08:21:51,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:21:51,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-31 08:21:51,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:51,580 INFO L225 Difference]: With dead ends: 86 [2018-01-31 08:21:51,580 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 08:21:51,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:21:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 08:21:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-31 08:21:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 08:21:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-31 08:21:51,589 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 20 [2018-01-31 08:21:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:51,589 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-31 08:21:51,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:21:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-31 08:21:51,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:21:51,590 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:51,590 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:21:51,590 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:51,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2098544683, now seen corresponding path program 1 times [2018-01-31 08:21:51,591 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:51,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:51,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:51,592 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:51,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:51,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:51,738 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-31 08:21:51,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:51,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:21:51,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:21:51,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:21:51,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:21:51,739 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 5 states. [2018-01-31 08:21:52,045 WARN L143 SmtUtils]: Spent 139ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:21:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:52,090 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-01-31 08:21:52,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:21:52,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-31 08:21:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:52,092 INFO L225 Difference]: With dead ends: 85 [2018-01-31 08:21:52,092 INFO L226 Difference]: Without dead ends: 84 [2018-01-31 08:21:52,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:21:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-31 08:21:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-31 08:21:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 08:21:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-31 08:21:52,101 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 20 [2018-01-31 08:21:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:52,101 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-31 08:21:52,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:21:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-31 08:21:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:21:52,102 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:52,102 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:21:52,103 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:52,103 INFO L82 PathProgramCache]: Analyzing trace with hash 996521205, now seen corresponding path program 1 times [2018-01-31 08:21:52,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:52,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:52,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:52,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:52,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:52,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:52,187 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-31 08:21:52,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:52,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:21:52,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:21:52,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:21:52,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:21:52,189 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-01-31 08:21:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:52,330 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-01-31 08:21:52,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:21:52,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-31 08:21:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:52,332 INFO L225 Difference]: With dead ends: 88 [2018-01-31 08:21:52,332 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 08:21:52,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:21:52,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 08:21:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-01-31 08:21:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 08:21:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-31 08:21:52,341 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 29 [2018-01-31 08:21:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:52,342 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-31 08:21:52,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:21:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-31 08:21:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:21:52,343 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:52,343 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:21:52,343 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:52,344 INFO L82 PathProgramCache]: Analyzing trace with hash 996521206, now seen corresponding path program 1 times [2018-01-31 08:21:52,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:52,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:52,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:52,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:52,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:52,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:52,553 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-31 08:21:52,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:52,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:21:52,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:21:52,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:21:52,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:21:52,555 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 9 states. [2018-01-31 08:21:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:53,088 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-01-31 08:21:53,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:21:53,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-31 08:21:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:53,092 INFO L225 Difference]: With dead ends: 126 [2018-01-31 08:21:53,092 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 08:21:53,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:21:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 08:21:53,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-01-31 08:21:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 08:21:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-01-31 08:21:53,102 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 29 [2018-01-31 08:21:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:53,102 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-01-31 08:21:53,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:21:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-01-31 08:21:53,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:21:53,103 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:53,104 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:21:53,104 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:53,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1349802918, now seen corresponding path program 1 times [2018-01-31 08:21:53,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:53,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:53,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:53,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:53,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:53,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:53,243 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-31 08:21:53,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:53,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:21:53,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:21:53,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:21:53,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:21:53,244 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 6 states. [2018-01-31 08:21:53,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:53,317 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-31 08:21:53,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:21:53,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-01-31 08:21:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:53,318 INFO L225 Difference]: With dead ends: 97 [2018-01-31 08:21:53,318 INFO L226 Difference]: Without dead ends: 94 [2018-01-31 08:21:53,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:21:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-31 08:21:53,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-01-31 08:21:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 08:21:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-31 08:21:53,327 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 37 [2018-01-31 08:21:53,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:53,327 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-31 08:21:53,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:21:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-31 08:21:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:21:53,329 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:53,329 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:21:53,329 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:53,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1349802917, now seen corresponding path program 1 times [2018-01-31 08:21:53,329 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:53,329 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:53,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:53,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:53,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:53,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:53,569 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-31 08:21:53,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:53,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:21:53,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:21:53,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:21:53,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:21:53,570 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 9 states. [2018-01-31 08:21:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:53,832 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2018-01-31 08:21:53,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:21:53,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-31 08:21:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:53,833 INFO L225 Difference]: With dead ends: 124 [2018-01-31 08:21:53,834 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 08:21:53,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:21:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 08:21:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2018-01-31 08:21:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:21:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-01-31 08:21:53,842 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 37 [2018-01-31 08:21:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:53,843 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-01-31 08:21:53,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:21:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-01-31 08:21:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 08:21:53,844 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:53,845 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:21:53,845 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:53,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1713049875, now seen corresponding path program 1 times [2018-01-31 08:21:53,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:53,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:53,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:53,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:53,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:53,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:54,003 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-31 08:21:54,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:54,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:21:54,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:21:54,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:21:54,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:21:54,004 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 6 states. [2018-01-31 08:21:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:54,228 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-01-31 08:21:54,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:21:54,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-31 08:21:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:54,231 INFO L225 Difference]: With dead ends: 98 [2018-01-31 08:21:54,231 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 08:21:54,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:21:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 08:21:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-31 08:21:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 08:21:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-31 08:21:54,240 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 42 [2018-01-31 08:21:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:54,240 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-31 08:21:54,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:21:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-31 08:21:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-31 08:21:54,242 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:54,242 INFO L351 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] [2018-01-31 08:21:54,242 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1645612283, now seen corresponding path program 1 times [2018-01-31 08:21:54,242 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:54,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:54,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:54,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:54,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:54,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:54,323 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-31 08:21:54,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:54,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:21:54,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:21:54,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:21:54,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:21:54,325 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 3 states. [2018-01-31 08:21:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:54,401 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2018-01-31 08:21:54,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:21:54,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-01-31 08:21:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:54,403 INFO L225 Difference]: With dead ends: 133 [2018-01-31 08:21:54,403 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 08:21:54,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:21:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 08:21:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-31 08:21:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 08:21:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-31 08:21:54,414 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 48 [2018-01-31 08:21:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:54,414 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-31 08:21:54,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:21:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-31 08:21:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 08:21:54,416 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:54,416 INFO L351 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] [2018-01-31 08:21:54,416 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:54,416 INFO L82 PathProgramCache]: Analyzing trace with hash 152655742, now seen corresponding path program 1 times [2018-01-31 08:21:54,416 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:54,416 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:54,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:54,417 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:54,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:54,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:21:54,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:54,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:21:54,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:21:54,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:21:54,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:21:54,529 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 7 states. [2018-01-31 08:21:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:54,615 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-01-31 08:21:54,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:21:54,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-31 08:21:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:54,616 INFO L225 Difference]: With dead ends: 85 [2018-01-31 08:21:54,616 INFO L226 Difference]: Without dead ends: 84 [2018-01-31 08:21:54,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:21:54,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-31 08:21:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-31 08:21:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 08:21:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-31 08:21:54,622 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 50 [2018-01-31 08:21:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:54,623 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-31 08:21:54,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:21:54,623 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-31 08:21:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 08:21:54,624 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:54,624 INFO L351 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] [2018-01-31 08:21:54,624 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash 152655743, now seen corresponding path program 1 times [2018-01-31 08:21:54,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:54,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:54,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:54,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:54,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:54,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:21:55,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:21:55,050 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-31 08:21:55,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:55,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:21:55,185 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 14 treesize of output 11 [2018-01-31 08:21:55,201 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 11 treesize of output 10 [2018-01-31 08:21:55,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:55,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:21:55,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:21:55,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-31 08:21:55,513 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 18 treesize of output 14 [2018-01-31 08:21:55,541 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 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 08:21:55,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:21:55,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:21:55,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:21:55,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-31 08:21:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:21:55,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:21:55,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-01-31 08:21:55,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:21:55,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:21:55,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:21:55,855 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 22 states. [2018-01-31 08:21:56,740 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 69 DAG size of output 50 [2018-01-31 08:21:57,042 WARN L146 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 74 DAG size of output 54 [2018-01-31 08:21:57,260 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 68 DAG size of output 49 [2018-01-31 08:21:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:58,078 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-01-31 08:21:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:21:58,081 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-01-31 08:21:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:58,083 INFO L225 Difference]: With dead ends: 150 [2018-01-31 08:21:58,083 INFO L226 Difference]: Without dead ends: 147 [2018-01-31 08:21:58,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 08:21:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-31 08:21:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 97. [2018-01-31 08:21:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 08:21:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-31 08:21:58,096 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 50 [2018-01-31 08:21:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:58,096 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-31 08:21:58,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:21:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-31 08:21:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 08:21:58,098 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:58,098 INFO L351 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] [2018-01-31 08:21:58,098 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:58,098 INFO L82 PathProgramCache]: Analyzing trace with hash -503133295, now seen corresponding path program 1 times [2018-01-31 08:21:58,098 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:58,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:58,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:58,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:58,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:58,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:21:58,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:21:58,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:21:58,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:21:58,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:21:58,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:21:58,416 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 7 states. [2018-01-31 08:21:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:58,477 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-01-31 08:21:58,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:21:58,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-01-31 08:21:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:58,478 INFO L225 Difference]: With dead ends: 97 [2018-01-31 08:21:58,478 INFO L226 Difference]: Without dead ends: 96 [2018-01-31 08:21:58,478 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:21:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-31 08:21:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-31 08:21:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-31 08:21:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-01-31 08:21:58,488 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 51 [2018-01-31 08:21:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:58,488 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-01-31 08:21:58,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:21:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-01-31 08:21:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 08:21:58,490 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:58,490 INFO L351 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] [2018-01-31 08:21:58,490 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:58,490 INFO L82 PathProgramCache]: Analyzing trace with hash -503133294, now seen corresponding path program 1 times [2018-01-31 08:21:58,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:58,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:58,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:58,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:58,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:58,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:59,053 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 19 DAG size of output 15 [2018-01-31 08:21:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:21:59,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:21:59,249 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-31 08:21:59,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:21:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:59,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:21:59,312 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-31 08:21:59,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:59,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:21:59,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:21:59,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:21:59,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:21:59,444 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 11 treesize of output 4 [2018-01-31 08:21:59,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:59,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:21:59,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 08:21:59,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 08:21:59,487 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 11 treesize of output 10 [2018-01-31 08:21:59,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:59,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:21:59,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:21:59,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-31 08:21:59,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-31 08:21:59,539 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 11 treesize of output 10 [2018-01-31 08:21:59,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:59,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:21:59,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 08:21:59,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-31 08:21:59,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-31 08:21:59,786 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 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 08:21:59,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:21:59,794 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 8 treesize of output 1 [2018-01-31 08:21:59,794 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:59,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:21:59,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:21:59,807 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-31 08:21:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:21:59,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:21:59,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-01-31 08:21:59,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:21:59,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:21:59,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:21:59,918 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 27 states. [2018-01-31 08:22:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:01,179 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2018-01-31 08:22:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:22:01,179 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-01-31 08:22:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:01,180 INFO L225 Difference]: With dead ends: 209 [2018-01-31 08:22:01,180 INFO L226 Difference]: Without dead ends: 207 [2018-01-31 08:22:01,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 08:22:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-31 08:22:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 152. [2018-01-31 08:22:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-31 08:22:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2018-01-31 08:22:01,197 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 51 [2018-01-31 08:22:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:01,197 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2018-01-31 08:22:01,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:22:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2018-01-31 08:22:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-31 08:22:01,198 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:01,199 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-01-31 08:22:01,199 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:22:01,200 INFO L82 PathProgramCache]: Analyzing trace with hash 869719771, now seen corresponding path program 2 times [2018-01-31 08:22:01,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:01,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:01,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:01,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:22:01,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:01,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:01,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:22:01,894 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-31 08:22:01,899 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:22:01,913 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:22:01,920 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:22:01,922 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:22:01,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:22:01,932 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-31 08:22:01,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:01,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:01,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:22:01,969 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 16 treesize of output 13 [2018-01-31 08:22:01,971 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 13 treesize of output 12 [2018-01-31 08:22:01,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:01,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:01,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:01,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-31 08:22:02,364 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 20 treesize of output 16 [2018-01-31 08:22:02,383 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 08:22:02,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:22:02,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:22:02,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:22:02,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-31 08:22:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:02,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:22:02,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-01-31 08:22:02,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:22:02,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:22:02,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:22:02,557 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand 27 states. [2018-01-31 08:22:03,978 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 67 DAG size of output 57 [2018-01-31 08:22:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:04,890 INFO L93 Difference]: Finished difference Result 274 states and 293 transitions. [2018-01-31 08:22:04,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:22:04,890 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-01-31 08:22:04,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:04,892 INFO L225 Difference]: With dead ends: 274 [2018-01-31 08:22:04,892 INFO L226 Difference]: Without dead ends: 271 [2018-01-31 08:22:04,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=353, Invalid=1903, Unknown=0, NotChecked=0, Total=2256 [2018-01-31 08:22:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-31 08:22:04,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 99. [2018-01-31 08:22:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 08:22:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-31 08:22:04,913 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 63 [2018-01-31 08:22:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:04,913 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-31 08:22:04,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:22:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-31 08:22:04,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-31 08:22:04,914 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:22:04,914 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-31 08:22:04,915 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:22:04,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2118436142, now seen corresponding path program 2 times [2018-01-31 08:22:04,916 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:22:04,916 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:22:04,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:04,917 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:22:04,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:22:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:22:04,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:22:05,613 WARN L146 SmtUtils]: Spent 283ms on a formula simplification. DAG size of input: 23 DAG size of output 17 [2018-01-31 08:22:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:05,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:22:05,916 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-31 08:22:05,923 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:22:05,938 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:22:05,947 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:22:05,951 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:22:05,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:22:05,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 6 treesize of output 5 [2018-01-31 08:22:05,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:05,988 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-31 08:22:05,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:06,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:06,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:22:06,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:22:06,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:22:06,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 11 treesize of output 4 [2018-01-31 08:22:06,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:06,122 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 12 treesize of output 15 [2018-01-31 08:22:06,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:06,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:06,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-31 08:22:06,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 08:22:06,170 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 13 treesize of output 12 [2018-01-31 08:22:06,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:06,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:06,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:06,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-31 08:22:06,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-31 08:22:06,209 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 13 treesize of output 12 [2018-01-31 08:22:06,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:06,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:22:06,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:22:06,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-31 08:22:06,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-01-31 08:22:06,593 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 08:22:06,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:22:06,600 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 1 [2018-01-31 08:22:06,601 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:22:06,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:22:06,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:22:06,614 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-31 08:22:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:22:06,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:22:06,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-01-31 08:22:06,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-31 08:22:06,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-31 08:22:06,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:22:06,718 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 28 states. [2018-01-31 08:22:10,387 WARN L146 SmtUtils]: Spent 3036ms on a formula simplification. DAG size of input: 77 DAG size of output 52 [2018-01-31 08:22:13,188 WARN L146 SmtUtils]: Spent 2693ms on a formula simplification. DAG size of input: 97 DAG size of output 63 [2018-01-31 08:22:14,965 WARN L146 SmtUtils]: Spent 1728ms on a formula simplification. DAG size of input: 104 DAG size of output 71 [2018-01-31 08:22:16,455 WARN L146 SmtUtils]: Spent 1441ms on a formula simplification. DAG size of input: 84 DAG size of output 60 [2018-01-31 08:22:21,072 WARN L146 SmtUtils]: Spent 4569ms on a formula simplification. DAG size of input: 89 DAG size of output 64 [2018-01-31 08:22:23,220 WARN L146 SmtUtils]: Spent 2106ms on a formula simplification. DAG size of input: 76 DAG size of output 56 [2018-01-31 08:22:25,617 WARN L146 SmtUtils]: Spent 2298ms on a formula simplification. DAG size of input: 93 DAG size of output 69 [2018-01-31 08:22:26,488 WARN L146 SmtUtils]: Spent 816ms on a formula simplification. DAG size of input: 93 DAG size of output 70 [2018-01-31 08:22:26,812 WARN L146 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 76 DAG size of output 57 [2018-01-31 08:22:27,120 WARN L146 SmtUtils]: Spent 257ms on a formula simplification. DAG size of input: 84 DAG size of output 63 [2018-01-31 08:22:28,077 WARN L146 SmtUtils]: Spent 905ms on a formula simplification. DAG size of input: 79 DAG size of output 57 [2018-01-31 08:22:28,450 WARN L146 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 96 DAG size of output 70 [2018-01-31 08:22:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:22:28,463 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-01-31 08:22:28,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:22:28,464 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-01-31 08:22:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:22:28,464 INFO L225 Difference]: With dead ends: 123 [2018-01-31 08:22:28,464 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:22:28,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=310, Invalid=1852, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:22:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:22:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:22:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:22:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:22:28,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-01-31 08:22:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:22:28,466 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:22:28,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-31 08:22:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:22:28,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:22:28,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:22:28,522 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:22:28,539 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:22:28,544 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:22:28,596 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:22:28,657 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:22:28,712 WARN L146 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 214 DAG size of output 194 [2018-01-31 08:22:28,763 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:22:28,774 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:22:28,792 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:22:28,888 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 211 DAG size of output 198 [2018-01-31 08:22:44,662 WARN L146 SmtUtils]: Spent 15770ms on a formula simplification. DAG size of input: 225 DAG size of output 160 [2018-01-31 08:22:44,857 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 115 DAG size of output 1 [2018-01-31 08:22:45,071 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 86 DAG size of output 58 Received shutdown request... [2018-01-31 08:24:30,126 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-01-31 08:24:30,127 INFO L168 Benchmark]: Toolchain (without parser) took 161332.28 ms. Allocated memory was 307.2 MB in the beginning and 612.4 MB in the end (delta: 305.1 MB). Free memory was 267.0 MB in the beginning and 473.6 MB in the end (delta: -206.7 MB). Peak memory consumption was 254.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:24:30,128 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.2 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:24:30,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.72 ms. Allocated memory is still 307.2 MB. Free memory was 266.0 MB in the beginning and 256.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:24:30,133 INFO L168 Benchmark]: Boogie Preprocessor took 40.86 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:24:30,133 INFO L168 Benchmark]: RCFGBuilder took 598.25 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 231.0 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:24:30,134 INFO L168 Benchmark]: TraceAbstraction took 160377.78 ms. Allocated memory was 307.2 MB in the beginning and 612.4 MB in the end (delta: 305.1 MB). Free memory was 231.0 MB in the beginning and 473.6 MB in the end (delta: -242.6 MB). Peak memory consumption was 218.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:24:30,135 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.17 ms. Allocated memory is still 307.2 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 303.72 ms. Allocated memory is still 307.2 MB. Free memory was 266.0 MB in the beginning and 256.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.86 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 598.25 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 231.0 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 160377.78 ms. Allocated memory was 307.2 MB in the beginning and 612.4 MB in the end (delta: 305.1 MB). Free memory was 231.0 MB in the beginning and 473.6 MB in the end (delta: -242.6 MB). Peak memory consumption was 218.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 227. RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-24-30-141.csv Completed graceful shutdown