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-acfac67 [2018-01-28 21:01:15,885 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:01:15,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:01:15,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:01:15,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:01:15,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:01:15,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:01:15,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:01:15,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:01:15,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:01:15,909 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:01:15,909 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:01:15,910 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:01:15,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:01:15,911 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:01:15,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:01:15,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:01:15,918 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:01:15,919 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:01:15,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:01:15,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:01:15,923 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:01:15,923 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:01:15,924 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:01:15,925 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:01:15,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:01:15,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:01:15,928 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:01:15,928 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:01:15,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:01:15,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:01:15,929 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:01:15,940 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:01:15,940 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:01:15,941 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:01:15,941 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:01:15,942 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:01:15,942 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:01:15,942 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:01:15,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:01:15,943 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:01:15,943 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:01:15,943 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:01:15,944 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:01:15,944 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:01:15,944 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:01:15,944 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:01:15,944 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:01:15,945 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:01:15,945 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:01:15,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:01:15,945 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:01:15,945 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:01:15,946 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:01:15,946 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:01:15,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:01:15,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:01:15,947 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:01:15,947 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:01:15,947 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:01:15,947 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:01:15,947 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:01:15,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:01:15,948 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:01:15,949 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:01:15,949 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:01:15,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:01:15,997 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:01:16,002 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:01:16,004 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:01:16,004 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:01:16,005 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-28 21:01:16,210 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:01:16,216 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:01:16,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:01:16,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:01:16,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:01:16,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:01:16" (1/1) ... [2018-01-28 21:01:16,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2013e725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:16, skipping insertion in model container [2018-01-28 21:01:16,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:01:16" (1/1) ... [2018-01-28 21:01:16,239 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:01:16,277 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:01:16,398 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:01:16,421 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:01:16,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:16 WrapperNode [2018-01-28 21:01:16,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:01:16,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:01:16,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:01:16,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:01:16,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:16" (1/1) ... [2018-01-28 21:01:16,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:16" (1/1) ... [2018-01-28 21:01:16,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:16" (1/1) ... [2018-01-28 21:01:16,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:16" (1/1) ... [2018-01-28 21:01:16,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:16" (1/1) ... [2018-01-28 21:01:16,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:16" (1/1) ... [2018-01-28 21:01:16,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:16" (1/1) ... [2018-01-28 21:01:16,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:01:16,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:01:16,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:01:16,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:01:16,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:01:16,507 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:01:16,507 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:01:16,507 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-28 21:01:16,507 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:01:16,507 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:01:16,508 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:01:16,508 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:01:16,508 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:01:16,508 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:01:16,508 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:01:16,508 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-28 21:01:16,508 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:01:16,508 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:01:16,508 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:01:16,786 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:01:16,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:01:16 BoogieIcfgContainer [2018-01-28 21:01:16,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:01:16,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:01:16,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:01:16,791 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:01:16,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:01:16" (1/3) ... [2018-01-28 21:01:16,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ebcd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:01:16, skipping insertion in model container [2018-01-28 21:01:16,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:01:16" (2/3) ... [2018-01-28 21:01:16,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ebcd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:01:16, skipping insertion in model container [2018-01-28 21:01:16,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:01:16" (3/3) ... [2018-01-28 21:01:16,793 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:01:16,802 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:01:16,809 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-28 21:01:16,859 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:01:16,860 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:01:16,860 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:01:16,860 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:01:16,860 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:01:16,860 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:01:16,860 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:01:16,861 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:01:16,862 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:01:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-28 21:01:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:01:16,890 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:16,891 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:16,892 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:16,897 INFO L82 PathProgramCache]: Analyzing trace with hash 486494336, now seen corresponding path program 1 times [2018-01-28 21:01:16,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:16,900 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:16,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:16,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:16,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:17,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:17,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:17,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:01:17,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:01:17,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:01:17,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:01:17,259 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2018-01-28 21:01:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:17,407 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-01-28 21:01:17,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:01:17,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 21:01:17,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:17,420 INFO L225 Difference]: With dead ends: 149 [2018-01-28 21:01:17,421 INFO L226 Difference]: Without dead ends: 87 [2018-01-28 21:01:17,425 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:01:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-28 21:01:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-28 21:01:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 21:01:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-01-28 21:01:17,464 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2018-01-28 21:01:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:17,465 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-01-28 21:01:17,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:01:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-01-28 21:01:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:01:17,466 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:17,466 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:17,466 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:17,466 INFO L82 PathProgramCache]: Analyzing trace with hash 486494337, now seen corresponding path program 1 times [2018-01-28 21:01:17,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:17,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:17,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:17,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:17,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:17,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:17,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:17,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:01:17,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:01:17,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:01:17,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:01:17,664 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 6 states. [2018-01-28 21:01:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:17,740 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-01-28 21:01:17,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:01:17,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-28 21:01:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:17,743 INFO L225 Difference]: With dead ends: 87 [2018-01-28 21:01:17,743 INFO L226 Difference]: Without dead ends: 86 [2018-01-28 21:01:17,744 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:01:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-28 21:01:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-28 21:01:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-28 21:01:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-28 21:01:17,753 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 19 [2018-01-28 21:01:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:17,754 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-28 21:01:17,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:01:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-28 21:01:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:01:17,755 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:17,755 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:17,755 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:17,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2098544684, now seen corresponding path program 1 times [2018-01-28 21:01:17,756 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:17,756 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:17,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:17,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:17,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:17,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:17,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:17,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:01:17,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:01:17,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:01:17,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:01:17,804 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 4 states. [2018-01-28 21:01:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:17,870 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-28 21:01:17,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:01:17,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-28 21:01:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:17,871 INFO L225 Difference]: With dead ends: 86 [2018-01-28 21:01:17,871 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 21:01:17,872 INFO L533 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-28 21:01:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 21:01:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-28 21:01:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 21:01:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-28 21:01:17,881 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 20 [2018-01-28 21:01:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:17,881 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-28 21:01:17,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:01:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-28 21:01:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:01:17,882 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:17,882 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:17,882 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:17,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2098544683, now seen corresponding path program 1 times [2018-01-28 21:01:17,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:17,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:17,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:17,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:17,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:17,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:17,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:17,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:01:17,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:01:17,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:01:17,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:01:17,956 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 5 states. [2018-01-28 21:01:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:18,007 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-01-28 21:01:18,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:01:18,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-28 21:01:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:18,008 INFO L225 Difference]: With dead ends: 85 [2018-01-28 21:01:18,009 INFO L226 Difference]: Without dead ends: 84 [2018-01-28 21:01:18,009 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:01:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-28 21:01:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-28 21:01:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 21:01:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-28 21:01:18,015 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 20 [2018-01-28 21:01:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:18,015 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-28 21:01:18,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:01:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-28 21:01:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 21:01:18,016 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:18,017 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:18,017 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:18,017 INFO L82 PathProgramCache]: Analyzing trace with hash 996521205, now seen corresponding path program 1 times [2018-01-28 21:01:18,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:18,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:18,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:18,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:18,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:18,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:18,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:18,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:01:18,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:01:18,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:01:18,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:01:18,089 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-01-28 21:01:18,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:19,078 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-01-28 21:01:19,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:01:19,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-28 21:01:19,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:19,080 INFO L225 Difference]: With dead ends: 88 [2018-01-28 21:01:19,080 INFO L226 Difference]: Without dead ends: 86 [2018-01-28 21:01:19,081 INFO L533 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-28 21:01:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-28 21:01:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-01-28 21:01:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 21:01:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-28 21:01:19,087 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 29 [2018-01-28 21:01:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:19,088 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-28 21:01:19,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:01:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-28 21:01:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 21:01:19,088 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:19,089 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:19,089 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:19,089 INFO L82 PathProgramCache]: Analyzing trace with hash 996521206, now seen corresponding path program 1 times [2018-01-28 21:01:19,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:19,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:19,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:19,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:19,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:19,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:19,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:19,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:01:19,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:01:19,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:01:19,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:01:19,231 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 9 states. [2018-01-28 21:01:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:19,481 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-01-28 21:01:19,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:01:19,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-28 21:01:19,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:19,486 INFO L225 Difference]: With dead ends: 126 [2018-01-28 21:01:19,486 INFO L226 Difference]: Without dead ends: 124 [2018-01-28 21:01:19,487 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:01:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-28 21:01:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-01-28 21:01:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-28 21:01:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-01-28 21:01:19,496 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 29 [2018-01-28 21:01:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:19,496 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-01-28 21:01:19,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:01:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-01-28 21:01:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:01:19,498 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:19,498 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:19,498 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:19,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1349802918, now seen corresponding path program 1 times [2018-01-28 21:01:19,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:19,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:19,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:19,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:19,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:19,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:19,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:19,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:01:19,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:01:19,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:01:19,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:01:19,577 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 6 states. [2018-01-28 21:01:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:19,677 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-28 21:01:19,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:01:19,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-01-28 21:01:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:19,679 INFO L225 Difference]: With dead ends: 97 [2018-01-28 21:01:19,679 INFO L226 Difference]: Without dead ends: 94 [2018-01-28 21:01:19,680 INFO L533 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-28 21:01:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-28 21:01:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-01-28 21:01:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-28 21:01:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-28 21:01:19,689 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 37 [2018-01-28 21:01:19,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:19,689 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-28 21:01:19,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:01:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-28 21:01:19,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:01:19,691 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:19,691 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:19,691 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:19,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1349802917, now seen corresponding path program 1 times [2018-01-28 21:01:19,691 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:19,691 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:19,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:19,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:19,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:19,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:19,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:19,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:01:19,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:01:19,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:01:19,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:01:19,804 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 9 states. [2018-01-28 21:01:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:19,951 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2018-01-28 21:01:19,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:01:19,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-28 21:01:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:19,953 INFO L225 Difference]: With dead ends: 124 [2018-01-28 21:01:19,953 INFO L226 Difference]: Without dead ends: 121 [2018-01-28 21:01:19,954 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:01:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-28 21:01:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2018-01-28 21:01:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-28 21:01:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-01-28 21:01:19,964 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 37 [2018-01-28 21:01:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:19,964 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-01-28 21:01:19,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:01:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-01-28 21:01:19,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 21:01:19,966 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:19,966 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:19,966 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:19,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1713049875, now seen corresponding path program 1 times [2018-01-28 21:01:19,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:19,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:19,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:19,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:19,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:19,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:20,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:20,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:01:20,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:01:20,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:01:20,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:01:20,104 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 6 states. [2018-01-28 21:01:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:20,354 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-01-28 21:01:20,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:01:20,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-28 21:01:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:20,355 INFO L225 Difference]: With dead ends: 98 [2018-01-28 21:01:20,355 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 21:01:20,355 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:01:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 21:01:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-28 21:01:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 21:01:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-28 21:01:20,361 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 42 [2018-01-28 21:01:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:20,362 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-28 21:01:20,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:01:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-28 21:01:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-28 21:01:20,363 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:20,364 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:20,364 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1645612283, now seen corresponding path program 1 times [2018-01-28 21:01:20,364 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:20,364 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:20,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:20,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:20,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:20,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:01:20,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:20,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:01:20,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:01:20,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:01:20,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:01:20,401 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 3 states. [2018-01-28 21:01:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:20,416 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2018-01-28 21:01:20,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:01:20,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-01-28 21:01:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:20,418 INFO L225 Difference]: With dead ends: 133 [2018-01-28 21:01:20,418 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 21:01:20,418 INFO L533 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-28 21:01:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 21:01:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-28 21:01:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 21:01:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-28 21:01:20,426 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 48 [2018-01-28 21:01:20,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:20,427 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-28 21:01:20,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:01:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-28 21:01:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:01:20,428 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:20,428 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:20,428 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:20,429 INFO L82 PathProgramCache]: Analyzing trace with hash 152655742, now seen corresponding path program 1 times [2018-01-28 21:01:20,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:20,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:20,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:20,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:20,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:20,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:20,514 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-28 21:01:20,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:20,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:01:20,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:01:20,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:01:20,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:01:20,516 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 7 states. [2018-01-28 21:01:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:20,672 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-01-28 21:01:20,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:01:20,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-28 21:01:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:20,674 INFO L225 Difference]: With dead ends: 85 [2018-01-28 21:01:20,674 INFO L226 Difference]: Without dead ends: 84 [2018-01-28 21:01:20,674 INFO L533 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-28 21:01:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-28 21:01:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-28 21:01:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 21:01:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-28 21:01:20,680 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 50 [2018-01-28 21:01:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:20,681 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-28 21:01:20,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:01:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-28 21:01:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:01:20,682 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:20,682 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:20,682 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:20,682 INFO L82 PathProgramCache]: Analyzing trace with hash 152655743, now seen corresponding path program 1 times [2018-01-28 21:01:20,682 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:20,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:20,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:20,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:20,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:20,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:21,056 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-28 21:01:21,056 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:01:21,056 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:01:21,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:21,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:01:21,178 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-28 21:01:21,190 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-28 21:01:21,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:21,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:21,201 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-28 21:01:21,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-28 21:01:21,397 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-28 21:01:21,407 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-28 21:01:21,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:01:21,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:01:21,430 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-28 21:01:21,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-28 21:01:21,638 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-28 21:01:21,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:01:21,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-01-28 21:01:21,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-28 21:01:21,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-28 21:01:21,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-01-28 21:01:21,661 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 22 states. [2018-01-28 21:01:22,349 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 74 DAG size of output 54 [2018-01-28 21:01:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:22,997 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-01-28 21:01:22,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 21:01:22,997 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-01-28 21:01:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:22,999 INFO L225 Difference]: With dead ends: 150 [2018-01-28 21:01:22,999 INFO L226 Difference]: Without dead ends: 147 [2018-01-28 21:01:23,000 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2018-01-28 21:01:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-28 21:01:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 97. [2018-01-28 21:01:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-28 21:01:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-28 21:01:23,012 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 50 [2018-01-28 21:01:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:23,012 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-28 21:01:23,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-28 21:01:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-28 21:01:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 21:01:23,013 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:23,013 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:23,014 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:23,014 INFO L82 PathProgramCache]: Analyzing trace with hash -503133295, now seen corresponding path program 1 times [2018-01-28 21:01:23,014 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:23,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:23,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:23,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:23,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:23,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:23,088 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-28 21:01:23,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:01:23,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:01:23,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:01:23,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:01:23,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:01:23,089 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 7 states. [2018-01-28 21:01:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:23,209 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-01-28 21:01:23,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:01:23,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-01-28 21:01:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:23,210 INFO L225 Difference]: With dead ends: 97 [2018-01-28 21:01:23,210 INFO L226 Difference]: Without dead ends: 96 [2018-01-28 21:01:23,211 INFO L533 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-28 21:01:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-28 21:01:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-28 21:01:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-28 21:01:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-01-28 21:01:23,218 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 51 [2018-01-28 21:01:23,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:23,218 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-01-28 21:01:23,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:01:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-01-28 21:01:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 21:01:23,219 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:23,219 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:01:23,219 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:23,219 INFO L82 PathProgramCache]: Analyzing trace with hash -503133294, now seen corresponding path program 1 times [2018-01-28 21:01:23,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:23,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:23,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:23,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:23,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:23,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:23,494 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-28 21:01:23,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:01:23,495 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:01:23,504 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:23,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:01:23,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:01:23,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:23,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:23,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:01:23,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:23,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:23,567 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-28 21:01:23,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:23,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:23,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-28 21:01:23,601 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-28 21:01:23,602 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-28 21:01:23,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:23,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:23,609 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-28 21:01:23,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-28 21:01:23,634 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-28 21:01:23,636 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-28 21:01:23,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:23,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:23,647 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-28 21:01:23,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-28 21:01:23,824 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-28 21:01:23,830 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-28 21:01:23,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:01:23,837 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-28 21:01:23,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:23,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:01:23,851 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-28 21:01:23,852 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-28 21:01:23,952 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-28 21:01:23,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:01:23,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-01-28 21:01:23,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 21:01:23,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 21:01:23,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-01-28 21:01:23,975 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 27 states. [2018-01-28 21:01:24,413 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 56 DAG size of output 34 [2018-01-28 21:01:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:25,363 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2018-01-28 21:01:25,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 21:01:25,363 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-01-28 21:01:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:25,364 INFO L225 Difference]: With dead ends: 209 [2018-01-28 21:01:25,364 INFO L226 Difference]: Without dead ends: 207 [2018-01-28 21:01:25,365 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2018-01-28 21:01:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-28 21:01:25,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 152. [2018-01-28 21:01:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-28 21:01:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2018-01-28 21:01:25,379 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 51 [2018-01-28 21:01:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:25,380 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2018-01-28 21:01:25,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 21:01:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2018-01-28 21:01:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-28 21:01:25,381 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:25,381 INFO L330 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-28 21:01:25,381 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash 869719771, now seen corresponding path program 2 times [2018-01-28 21:01:25,381 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:25,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:25,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:25,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:01:25,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:25,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:25,789 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-28 21:01:25,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:01:25,789 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:01:25,796 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:01:25,811 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:01:25,818 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:01:25,820 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:01:25,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:01:25,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:01:25,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:25,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:25,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:01:25,861 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-28 21:01:25,862 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-28 21:01:25,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:25,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:25,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:25,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-28 21:01:26,080 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-28 21:01:26,088 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-28 21:01:26,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:01:26,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:01:26,114 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-28 21:01:26,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-28 21:01:26,259 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-28 21:01:26,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:01:26,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-01-28 21:01:26,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 21:01:26,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 21:01:26,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2018-01-28 21:01:26,280 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand 27 states. [2018-01-28 21:01:28,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:28,015 INFO L93 Difference]: Finished difference Result 274 states and 293 transitions. [2018-01-28 21:01:28,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 21:01:28,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-01-28 21:01:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:28,017 INFO L225 Difference]: With dead ends: 274 [2018-01-28 21:01:28,017 INFO L226 Difference]: Without dead ends: 271 [2018-01-28 21:01:28,018 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=353, Invalid=1903, Unknown=0, NotChecked=0, Total=2256 [2018-01-28 21:01:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-28 21:01:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 99. [2018-01-28 21:01:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 21:01:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-28 21:01:28,029 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 63 [2018-01-28 21:01:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:28,029 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-28 21:01:28,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 21:01:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-28 21:01:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 21:01:28,029 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:01:28,030 INFO L330 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-28 21:01:28,030 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:01:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2118436142, now seen corresponding path program 2 times [2018-01-28 21:01:28,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:01:28,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:01:28,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:28,031 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:01:28,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:01:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:01:28,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:01:28,582 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-28 21:01:28,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:01:28,583 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:01:28,588 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:01:28,599 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:01:28,607 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:01:28,610 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:01:28,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:01:28,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:01:28,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:28,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:01:28,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:28,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:28,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:01:28,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:28,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:01:28,685 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-28 21:01:28,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:28,697 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-28 21:01:28,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:28,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:28,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-28 21:01:28,745 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-28 21:01:28,747 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-28 21:01:28,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:28,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:28,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:28,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-28 21:01:28,782 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-28 21:01:28,784 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-28 21:01:28,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:28,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:01:28,794 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-28 21:01:28,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-28 21:01:29,115 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-28 21:01:29,126 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-28 21:01:29,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:01:29,134 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-28 21:01:29,134 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:01:29,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:01:29,146 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-28 21:01:29,146 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-28 21:01:29,224 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-28 21:01:29,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:01:29,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-01-28 21:01:29,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-28 21:01:29,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-28 21:01:29,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2018-01-28 21:01:29,273 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 28 states. [2018-01-28 21:01:35,876 WARN L146 SmtUtils]: Spent 6077ms on a formula simplification. DAG size of input: 77 DAG size of output 52 [2018-01-28 21:01:36,323 WARN L146 SmtUtils]: Spent 337ms on a formula simplification. DAG size of input: 97 DAG size of output 63 [2018-01-28 21:01:38,550 WARN L146 SmtUtils]: Spent 2156ms on a formula simplification. DAG size of input: 104 DAG size of output 71 [2018-01-28 21:01:38,994 WARN L146 SmtUtils]: Spent 395ms on a formula simplification. DAG size of input: 84 DAG size of output 60 [2018-01-28 21:01:41,885 WARN L146 SmtUtils]: Spent 2840ms on a formula simplification. DAG size of input: 89 DAG size of output 64 [2018-01-28 21:01:44,038 WARN L146 SmtUtils]: Spent 2112ms on a formula simplification. DAG size of input: 76 DAG size of output 56 [2018-01-28 21:01:44,521 WARN L146 SmtUtils]: Spent 390ms on a formula simplification. DAG size of input: 93 DAG size of output 69 [2018-01-28 21:01:46,713 WARN L146 SmtUtils]: Spent 2107ms on a formula simplification. DAG size of input: 93 DAG size of output 70 [2018-01-28 21:01:49,069 WARN L146 SmtUtils]: Spent 2311ms on a formula simplification. DAG size of input: 76 DAG size of output 57 [2018-01-28 21:01:49,364 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 84 DAG size of output 63 [2018-01-28 21:01:49,693 WARN L146 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 79 DAG size of output 57 [2018-01-28 21:01:50,245 WARN L146 SmtUtils]: Spent 447ms on a formula simplification. DAG size of input: 96 DAG size of output 70 [2018-01-28 21:01:50,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:01:50,255 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-01-28 21:01:50,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 21:01:50,255 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-01-28 21:01:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:01:50,255 INFO L225 Difference]: With dead ends: 123 [2018-01-28 21:01:50,256 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 21:01:50,257 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=310, Invalid=1852, Unknown=0, NotChecked=0, Total=2162 [2018-01-28 21:01:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 21:01:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 21:01:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 21:01:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 21:01:50,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-01-28 21:01:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:01:50,257 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 21:01:50,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-28 21:01:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 21:01:50,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 21:01:50,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 21:01:50,288 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:01:50,297 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:01:50,302 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:01:50,342 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:01:50,402 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:01:50,455 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 222 DAG size of output 202 [2018-01-28 21:01:50,507 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:01:50,519 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:01:50,538 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:01:50,640 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 211 DAG size of output 198 Received shutdown request... [2018-01-28 21:03:55,968 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-28 21:03:55,969 INFO L168 Benchmark]: Toolchain (without parser) took 159759.10 ms. Allocated memory was 306.7 MB in the beginning and 598.2 MB in the end (delta: 291.5 MB). Free memory was 266.7 MB in the beginning and 396.1 MB in the end (delta: -129.4 MB). Peak memory consumption was 235.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:03:55,971 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:03:55,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.87 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 255.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-28 21:03:55,971 INFO L168 Benchmark]: Boogie Preprocessor took 32.59 ms. Allocated memory is still 306.7 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:03:55,971 INFO L168 Benchmark]: RCFGBuilder took 326.06 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 230.7 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. [2018-01-28 21:03:55,972 INFO L168 Benchmark]: TraceAbstraction took 159181.12 ms. Allocated memory was 306.7 MB in the beginning and 598.2 MB in the end (delta: 291.5 MB). Free memory was 230.7 MB in the beginning and 396.1 MB in the end (delta: -165.4 MB). Peak memory consumption was 198.9 MB. Max. memory is 5.3 GB. [2018-01-28 21:03:55,973 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.20 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.87 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 255.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.59 ms. Allocated memory is still 306.7 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 326.06 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 230.7 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 159181.12 ms. Allocated memory was 306.7 MB in the beginning and 598.2 MB in the end (delta: 291.5 MB). Free memory was 230.7 MB in the beginning and 396.1 MB in the end (delta: -165.4 MB). Peak memory consumption was 198.9 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 233. 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-28_21-03-55-980.csv Completed graceful shutdown