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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:07:34,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:07:34,883 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:07:34,893 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:07:34,893 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:07:34,894 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:07:34,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:07:34,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:07:34,897 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:07:34,898 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:07:34,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:07:34,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:07:34,900 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:07:34,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:07:34,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:07:34,904 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:07:34,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:07:34,907 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:07:34,908 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:07:34,909 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:07:34,910 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:07:34,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:07:34,911 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:07:34,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:07:34,912 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:07:34,913 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:07:34,913 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:07:34,914 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:07:34,914 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:07:34,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:07:34,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:07:34,915 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:07:34,925 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:07:34,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:07:34,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:07:34,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:07:34,926 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:07:34,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:07:34,926 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:07:34,926 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:07:34,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:07:34,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:07:34,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:07:34,927 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:07:34,927 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:07:34,927 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:07:34,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:07:34,928 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:07:34,928 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:07:34,928 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:07:34,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:07:34,928 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:07:34,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:07:34,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:07:34,929 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:07:34,929 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:07:34,929 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:07:34,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:07:34,966 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:07:34,969 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:07:34,971 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:07:34,971 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:07:34,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01_false-valid-memtrack.i [2018-02-02 09:07:35,123 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:07:35,124 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:07:35,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:07:35,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:07:35,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:07:35,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:07:35" (1/1) ... [2018-02-02 09:07:35,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3362d3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:35, skipping insertion in model container [2018-02-02 09:07:35,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:07:35" (1/1) ... [2018-02-02 09:07:35,150 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:07:35,179 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:07:35,279 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:07:35,303 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:07:35,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:35 WrapperNode [2018-02-02 09:07:35,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:07:35,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:07:35,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:07:35,313 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:07:35,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:35" (1/1) ... [2018-02-02 09:07:35,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:35" (1/1) ... [2018-02-02 09:07:35,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:35" (1/1) ... [2018-02-02 09:07:35,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:35" (1/1) ... [2018-02-02 09:07:35,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:35" (1/1) ... [2018-02-02 09:07:35,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:35" (1/1) ... [2018-02-02 09:07:35,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:35" (1/1) ... [2018-02-02 09:07:35,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:07:35,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:07:35,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:07:35,348 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:07:35,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:35" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 09:07:35,389 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:07:35,389 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:07:35,390 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-02-02 09:07:35,390 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-02-02 09:07:35,390 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 09:07:35,390 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:07:35,390 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:07:35,390 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:07:35,390 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:07:35,390 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:07:35,390 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:07:35,390 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:07:35,390 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:07:35,390 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:07:35,391 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:07:35,391 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:07:35,391 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-02-02 09:07:35,391 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-02-02 09:07:35,391 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 09:07:35,391 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:07:35,391 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:07:35,391 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:07:35,868 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:07:35,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:07:35 BoogieIcfgContainer [2018-02-02 09:07:35,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:07:35,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:07:35,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:07:35,871 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:07:35,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:07:35" (1/3) ... [2018-02-02 09:07:35,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf04337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:07:35, skipping insertion in model container [2018-02-02 09:07:35,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:35" (2/3) ... [2018-02-02 09:07:35,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf04337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:07:35, skipping insertion in model container [2018-02-02 09:07:35,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:07:35" (3/3) ... [2018-02-02 09:07:35,874 INFO L107 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01_false-valid-memtrack.i [2018-02-02 09:07:35,880 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:07:35,887 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-02-02 09:07:35,914 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:07:35,914 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:07:35,914 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:07:35,914 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:07:35,915 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:07:35,915 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:07:35,915 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:07:35,915 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:07:35,916 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:07:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states. [2018-02-02 09:07:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 09:07:35,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:35,943 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:35,943 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:35,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1826704007, now seen corresponding path program 1 times [2018-02-02 09:07:35,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:35,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:35,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:35,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:35,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:36,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:36,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:36,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:07:36,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:07:36,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:07:36,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:07:36,154 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 3 states. [2018-02-02 09:07:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:36,349 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-02-02 09:07:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:07:36,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 09:07:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:36,361 INFO L225 Difference]: With dead ends: 208 [2018-02-02 09:07:36,361 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 09:07:36,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-02 09:07:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 09:07:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-02-02 09:07:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 09:07:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 217 transitions. [2018-02-02 09:07:36,417 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 217 transitions. Word has length 7 [2018-02-02 09:07:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:36,418 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 217 transitions. [2018-02-02 09:07:36,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:07:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 217 transitions. [2018-02-02 09:07:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 09:07:36,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:36,418 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:36,418 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:36,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1826704008, now seen corresponding path program 1 times [2018-02-02 09:07:36,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:36,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:36,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:36,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:36,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:36,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:36,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:36,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:07:36,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:07:36,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:07:36,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:07:36,490 INFO L87 Difference]: Start difference. First operand 205 states and 217 transitions. Second operand 3 states. [2018-02-02 09:07:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:36,640 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-02-02 09:07:36,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:07:36,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 09:07:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:36,643 INFO L225 Difference]: With dead ends: 206 [2018-02-02 09:07:36,643 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 09:07:36,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-02 09:07:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 09:07:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-02-02 09:07:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 09:07:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2018-02-02 09:07:36,653 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 7 [2018-02-02 09:07:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:36,654 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2018-02-02 09:07:36,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:07:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2018-02-02 09:07:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:07:36,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:36,654 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:36,654 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash 627159801, now seen corresponding path program 1 times [2018-02-02 09:07:36,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:36,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:36,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:36,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:36,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:36,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:36,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:36,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:36,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:07:36,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:07:36,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:36,717 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand 5 states. [2018-02-02 09:07:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:36,888 INFO L93 Difference]: Finished difference Result 202 states and 214 transitions. [2018-02-02 09:07:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:07:36,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 09:07:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:36,890 INFO L225 Difference]: With dead ends: 202 [2018-02-02 09:07:36,891 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 09:07:36,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:07:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 09:07:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-02-02 09:07:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 09:07:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 214 transitions. [2018-02-02 09:07:36,902 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 214 transitions. Word has length 14 [2018-02-02 09:07:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:36,903 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 214 transitions. [2018-02-02 09:07:36,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:07:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 214 transitions. [2018-02-02 09:07:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:07:36,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:36,904 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:36,904 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:36,904 INFO L82 PathProgramCache]: Analyzing trace with hash 627159802, now seen corresponding path program 1 times [2018-02-02 09:07:36,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:36,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:36,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:36,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:36,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:36,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:37,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:37,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:07:37,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:07:37,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:07:37,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:07:37,013 INFO L87 Difference]: Start difference. First operand 202 states and 214 transitions. Second operand 7 states. [2018-02-02 09:07:37,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:37,300 INFO L93 Difference]: Finished difference Result 222 states and 238 transitions. [2018-02-02 09:07:37,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:07:37,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 09:07:37,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:37,301 INFO L225 Difference]: With dead ends: 222 [2018-02-02 09:07:37,301 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 09:07:37,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:07:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 09:07:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 211. [2018-02-02 09:07:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 09:07:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2018-02-02 09:07:37,318 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 14 [2018-02-02 09:07:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:37,318 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2018-02-02 09:07:37,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:07:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2018-02-02 09:07:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 09:07:37,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:37,323 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:37,323 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:37,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2032882424, now seen corresponding path program 1 times [2018-02-02 09:07:37,324 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:37,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:37,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:37,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:37,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:37,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:37,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:37,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:07:37,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:37,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:37,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:37,351 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand 4 states. [2018-02-02 09:07:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:37,483 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-02-02 09:07:37,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:07:37,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 09:07:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:37,484 INFO L225 Difference]: With dead ends: 209 [2018-02-02 09:07:37,485 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 09:07:37,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 09:07:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-02-02 09:07:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 09:07:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 223 transitions. [2018-02-02 09:07:37,491 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 223 transitions. Word has length 15 [2018-02-02 09:07:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:37,491 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 223 transitions. [2018-02-02 09:07:37,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 223 transitions. [2018-02-02 09:07:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 09:07:37,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:37,492 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:37,492 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2032882423, now seen corresponding path program 1 times [2018-02-02 09:07:37,492 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:37,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:37,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:37,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:37,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:37,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:37,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:37,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:07:37,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:37,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:37,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:37,528 INFO L87 Difference]: Start difference. First operand 209 states and 223 transitions. Second operand 4 states. [2018-02-02 09:07:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:37,640 INFO L93 Difference]: Finished difference Result 207 states and 220 transitions. [2018-02-02 09:07:37,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:07:37,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 09:07:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:37,642 INFO L225 Difference]: With dead ends: 207 [2018-02-02 09:07:37,642 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 09:07:37,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 09:07:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-02-02 09:07:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 09:07:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 220 transitions. [2018-02-02 09:07:37,646 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 220 transitions. Word has length 15 [2018-02-02 09:07:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:37,646 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 220 transitions. [2018-02-02 09:07:37,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 220 transitions. [2018-02-02 09:07:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:07:37,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:37,647 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:37,647 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash -290527541, now seen corresponding path program 1 times [2018-02-02 09:07:37,647 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:37,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:37,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:37,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:37,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:37,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:37,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:37,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:07:37,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:07:37,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:07:37,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:07:37,861 INFO L87 Difference]: Start difference. First operand 207 states and 220 transitions. Second operand 13 states. [2018-02-02 09:07:38,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:38,588 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-02-02 09:07:38,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:07:38,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-02-02 09:07:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:38,590 INFO L225 Difference]: With dead ends: 209 [2018-02-02 09:07:38,590 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 09:07:38,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:07:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 09:07:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-02-02 09:07:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 09:07:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-02-02 09:07:38,596 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 20 [2018-02-02 09:07:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:38,597 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-02-02 09:07:38,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:07:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-02-02 09:07:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:07:38,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:38,598 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:38,598 INFO L371 AbstractCegarLoop]: === Iteration 8 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:38,598 INFO L82 PathProgramCache]: Analyzing trace with hash -30107462, now seen corresponding path program 1 times [2018-02-02 09:07:38,598 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:38,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:38,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:38,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:38,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:38,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:38,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:38,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:38,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:38,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:38,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:38,633 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 4 states. [2018-02-02 09:07:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:38,652 INFO L93 Difference]: Finished difference Result 294 states and 311 transitions. [2018-02-02 09:07:38,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:07:38,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 09:07:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:38,654 INFO L225 Difference]: With dead ends: 294 [2018-02-02 09:07:38,654 INFO L226 Difference]: Without dead ends: 294 [2018-02-02 09:07:38,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-02 09:07:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 258. [2018-02-02 09:07:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-02 09:07:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 311 transitions. [2018-02-02 09:07:38,659 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 311 transitions. Word has length 22 [2018-02-02 09:07:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:38,659 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 311 transitions. [2018-02-02 09:07:38,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 311 transitions. [2018-02-02 09:07:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:07:38,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:38,660 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:38,660 INFO L371 AbstractCegarLoop]: === Iteration 9 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash 929227204, now seen corresponding path program 1 times [2018-02-02 09:07:38,660 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:38,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:38,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:38,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:38,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:38,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:38,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:38,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:07:38,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:38,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:38,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:38,694 INFO L87 Difference]: Start difference. First operand 258 states and 311 transitions. Second operand 4 states. [2018-02-02 09:07:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:38,821 INFO L93 Difference]: Finished difference Result 245 states and 283 transitions. [2018-02-02 09:07:38,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:07:38,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-02 09:07:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:38,822 INFO L225 Difference]: With dead ends: 245 [2018-02-02 09:07:38,822 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 09:07:38,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 09:07:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-02-02 09:07:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 09:07:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 281 transitions. [2018-02-02 09:07:38,829 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 281 transitions. Word has length 26 [2018-02-02 09:07:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:38,830 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 281 transitions. [2018-02-02 09:07:38,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 281 transitions. [2018-02-02 09:07:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:07:38,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:38,831 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:38,831 INFO L371 AbstractCegarLoop]: === Iteration 10 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:38,831 INFO L82 PathProgramCache]: Analyzing trace with hash 929227205, now seen corresponding path program 1 times [2018-02-02 09:07:38,831 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:38,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:38,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:38,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:38,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:38,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:38,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:38,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:38,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:07:38,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:07:38,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:38,907 INFO L87 Difference]: Start difference. First operand 243 states and 281 transitions. Second operand 5 states. [2018-02-02 09:07:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:39,040 INFO L93 Difference]: Finished difference Result 230 states and 253 transitions. [2018-02-02 09:07:39,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:07:39,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 09:07:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:39,041 INFO L225 Difference]: With dead ends: 230 [2018-02-02 09:07:39,041 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 09:07:39,041 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:07:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 09:07:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-02-02 09:07:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 09:07:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 251 transitions. [2018-02-02 09:07:39,044 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 251 transitions. Word has length 26 [2018-02-02 09:07:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:39,044 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 251 transitions. [2018-02-02 09:07:39,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:07:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 251 transitions. [2018-02-02 09:07:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:07:39,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:39,045 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:39,045 INFO L371 AbstractCegarLoop]: === Iteration 11 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:39,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2007437674, now seen corresponding path program 1 times [2018-02-02 09:07:39,046 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:39,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:39,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:39,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:39,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:39,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:39,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:39,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:39,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:07:39,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:07:39,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:39,166 INFO L87 Difference]: Start difference. First operand 228 states and 251 transitions. Second operand 5 states. [2018-02-02 09:07:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:39,346 INFO L93 Difference]: Finished difference Result 295 states and 331 transitions. [2018-02-02 09:07:39,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:07:39,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 09:07:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:39,347 INFO L225 Difference]: With dead ends: 295 [2018-02-02 09:07:39,347 INFO L226 Difference]: Without dead ends: 295 [2018-02-02 09:07:39,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:07:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-02 09:07:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 238. [2018-02-02 09:07:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 09:07:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 265 transitions. [2018-02-02 09:07:39,352 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 265 transitions. Word has length 32 [2018-02-02 09:07:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:39,352 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 265 transitions. [2018-02-02 09:07:39,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:07:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 265 transitions. [2018-02-02 09:07:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:07:39,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:39,353 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:39,353 INFO L371 AbstractCegarLoop]: === Iteration 12 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2007437675, now seen corresponding path program 1 times [2018-02-02 09:07:39,353 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:39,353 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:39,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:39,354 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:39,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:39,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:39,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:39,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:07:39,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:07:39,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:07:39,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:07:39,432 INFO L87 Difference]: Start difference. First operand 238 states and 265 transitions. Second operand 6 states. [2018-02-02 09:07:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:39,600 INFO L93 Difference]: Finished difference Result 246 states and 269 transitions. [2018-02-02 09:07:39,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:07:39,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 09:07:39,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:39,601 INFO L225 Difference]: With dead ends: 246 [2018-02-02 09:07:39,601 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 09:07:39,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:07:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 09:07:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 238. [2018-02-02 09:07:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 09:07:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 261 transitions. [2018-02-02 09:07:39,607 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 261 transitions. Word has length 32 [2018-02-02 09:07:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:39,607 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 261 transitions. [2018-02-02 09:07:39,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:07:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 261 transitions. [2018-02-02 09:07:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:07:39,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:39,608 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:39,609 INFO L371 AbstractCegarLoop]: === Iteration 13 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2018693333, now seen corresponding path program 1 times [2018-02-02 09:07:39,609 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:39,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:39,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:39,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:39,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:39,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:39,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:39,698 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:07:39,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:39,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:39,793 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-02-02 09:07:39,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:07:39,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:39,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:39,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 09:07:39,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-02 09:07:39,826 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 13 treesize of output 10 [2018-02-02 09:07:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 09:07:39,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-02-02 09:07:39,913 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-02-02 09:07:39,916 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 32 treesize of output 1 [2018-02-02 09:07:39,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:27 [2018-02-02 09:07:39,935 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 31 treesize of output 25 [2018-02-02 09:07:39,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 10 [2018-02-02 09:07:39,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:39,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:07:39,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2018-02-02 09:07:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:07:39,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:39,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-02-02 09:07:39,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:07:39,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:07:39,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:07:39,999 INFO L87 Difference]: Start difference. First operand 238 states and 261 transitions. Second operand 13 states. [2018-02-02 09:07:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:40,404 INFO L93 Difference]: Finished difference Result 245 states and 267 transitions. [2018-02-02 09:07:40,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:07:40,404 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-02-02 09:07:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:40,405 INFO L225 Difference]: With dead ends: 245 [2018-02-02 09:07:40,405 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 09:07:40,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:07:40,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 09:07:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 237. [2018-02-02 09:07:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 09:07:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 259 transitions. [2018-02-02 09:07:40,415 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 259 transitions. Word has length 39 [2018-02-02 09:07:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:40,415 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 259 transitions. [2018-02-02 09:07:40,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:07:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 259 transitions. [2018-02-02 09:07:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:07:40,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:40,416 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:40,416 INFO L371 AbstractCegarLoop]: === Iteration 14 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2018693334, now seen corresponding path program 1 times [2018-02-02 09:07:40,417 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:40,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:40,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:40,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:40,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:40,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:40,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:40,632 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:07:40,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:40,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:40,678 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-02-02 09:07:40,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:07:40,686 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-02-02 09:07:40,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:40,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:40,696 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-02-02 09:07:40,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-02 09:07:40,709 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 13 treesize of output 10 [2018-02-02 09:07:40,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-02 09:07:40,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,724 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 13 treesize of output 10 [2018-02-02 09:07:40,727 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 10 treesize of output 9 [2018-02-02 09:07:40,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-02-02 09:07:40,784 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-02-02 09:07:40,787 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 32 treesize of output 1 [2018-02-02 09:07:40,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,808 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 51 treesize of output 52 [2018-02-02 09:07:40,813 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 32 treesize of output 1 [2018-02-02 09:07:40,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:34 [2018-02-02 09:07:40,862 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 31 treesize of output 25 [2018-02-02 09:07:40,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 10 [2018-02-02 09:07:40,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 15 [2018-02-02 09:07:40,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 09:07:40,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:40,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:12 [2018-02-02 09:07:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:40,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:40,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-02-02 09:07:40,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:07:40,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:07:40,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:07:40,914 INFO L87 Difference]: Start difference. First operand 237 states and 259 transitions. Second operand 15 states. [2018-02-02 09:07:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:41,577 INFO L93 Difference]: Finished difference Result 266 states and 287 transitions. [2018-02-02 09:07:41,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:07:41,577 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-02-02 09:07:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:41,580 INFO L225 Difference]: With dead ends: 266 [2018-02-02 09:07:41,580 INFO L226 Difference]: Without dead ends: 266 [2018-02-02 09:07:41,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:07:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-02 09:07:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2018-02-02 09:07:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-02 09:07:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 279 transitions. [2018-02-02 09:07:41,586 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 279 transitions. Word has length 39 [2018-02-02 09:07:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:41,586 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 279 transitions. [2018-02-02 09:07:41,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:07:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 279 transitions. [2018-02-02 09:07:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 09:07:41,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:41,588 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:41,588 INFO L371 AbstractCegarLoop]: === Iteration 15 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1460771081, now seen corresponding path program 1 times [2018-02-02 09:07:41,588 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:41,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:41,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:41,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:41,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:41,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:41,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:07:41,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:41,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:41,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:41,668 INFO L87 Difference]: Start difference. First operand 258 states and 279 transitions. Second operand 4 states. [2018-02-02 09:07:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:41,876 INFO L93 Difference]: Finished difference Result 262 states and 281 transitions. [2018-02-02 09:07:41,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:07:41,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-02-02 09:07:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:41,877 INFO L225 Difference]: With dead ends: 262 [2018-02-02 09:07:41,877 INFO L226 Difference]: Without dead ends: 262 [2018-02-02 09:07:41,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-02 09:07:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2018-02-02 09:07:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 09:07:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 275 transitions. [2018-02-02 09:07:41,883 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 275 transitions. Word has length 63 [2018-02-02 09:07:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:41,883 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 275 transitions. [2018-02-02 09:07:41,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 275 transitions. [2018-02-02 09:07:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 09:07:41,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:41,885 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:41,885 INFO L371 AbstractCegarLoop]: === Iteration 16 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:41,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1460771082, now seen corresponding path program 1 times [2018-02-02 09:07:41,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:41,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:41,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:41,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:41,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:41,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:41,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:07:41,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:41,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:41,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:41,954 INFO L87 Difference]: Start difference. First operand 256 states and 275 transitions. Second operand 4 states. [2018-02-02 09:07:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:42,075 INFO L93 Difference]: Finished difference Result 260 states and 277 transitions. [2018-02-02 09:07:42,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:07:42,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-02-02 09:07:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:42,077 INFO L225 Difference]: With dead ends: 260 [2018-02-02 09:07:42,077 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 09:07:42,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 09:07:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2018-02-02 09:07:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 09:07:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 271 transitions. [2018-02-02 09:07:42,083 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 271 transitions. Word has length 63 [2018-02-02 09:07:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:42,083 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 271 transitions. [2018-02-02 09:07:42,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 271 transitions. [2018-02-02 09:07:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 09:07:42,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:42,084 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:42,084 INFO L371 AbstractCegarLoop]: === Iteration 17 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:42,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2050431775, now seen corresponding path program 1 times [2018-02-02 09:07:42,085 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:42,085 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:42,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:42,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:42,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:42,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:42,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:42,148 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:07:42,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:42,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:42,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:42,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-02 09:07:42,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:07:42,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:07:42,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:07:42,252 INFO L87 Difference]: Start difference. First operand 254 states and 271 transitions. Second operand 7 states. [2018-02-02 09:07:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:42,272 INFO L93 Difference]: Finished difference Result 278 states and 295 transitions. [2018-02-02 09:07:42,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:07:42,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-02-02 09:07:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:42,274 INFO L225 Difference]: With dead ends: 278 [2018-02-02 09:07:42,274 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 09:07:42,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:07:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 09:07:42,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2018-02-02 09:07:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 09:07:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 285 transitions. [2018-02-02 09:07:42,279 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 285 transitions. Word has length 66 [2018-02-02 09:07:42,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:42,280 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 285 transitions. [2018-02-02 09:07:42,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:07:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 285 transitions. [2018-02-02 09:07:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 09:07:42,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:42,280 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:42,281 INFO L371 AbstractCegarLoop]: === Iteration 18 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1137393610, now seen corresponding path program 2 times [2018-02-02 09:07:42,281 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:42,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:42,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:42,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:42,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:42,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:42,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:42,348 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:07:42,366 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:07:42,391 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:07:42,395 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:07:42,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:42,407 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-02-02 09:07:42,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:42,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:42,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:07:42,435 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc3.base| 1)))) is different from true [2018-02-02 09:07:42,442 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1)))) is different from true [2018-02-02 09:07:42,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:42,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:42,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-02-02 09:07:42,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-02-02 09:07:42,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:42,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:42,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:07:42,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-02-02 09:07:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-02 09:07:42,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:07:42,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2018-02-02 09:07:42,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:07:42,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:07:42,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=102, Unknown=2, NotChecked=42, Total=182 [2018-02-02 09:07:42,568 INFO L87 Difference]: Start difference. First operand 268 states and 285 transitions. Second operand 14 states. [2018-02-02 09:07:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:43,028 INFO L93 Difference]: Finished difference Result 336 states and 362 transitions. [2018-02-02 09:07:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:07:43,028 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-02-02 09:07:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:43,029 INFO L225 Difference]: With dead ends: 336 [2018-02-02 09:07:43,029 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 09:07:43,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=222, Unknown=17, NotChecked=66, Total=380 [2018-02-02 09:07:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 09:07:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 303. [2018-02-02 09:07:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 09:07:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 328 transitions. [2018-02-02 09:07:43,033 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 328 transitions. Word has length 73 [2018-02-02 09:07:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:43,033 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 328 transitions. [2018-02-02 09:07:43,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:07:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 328 transitions. [2018-02-02 09:07:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 09:07:43,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:43,033 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:43,034 INFO L371 AbstractCegarLoop]: === Iteration 19 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:43,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1500484800, now seen corresponding path program 1 times [2018-02-02 09:07:43,034 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:43,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:43,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:43,034 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:07:43,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:43,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:43,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:43,085 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:43,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:43,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:43,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:43,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-02-02 09:07:43,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:07:43,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:07:43,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:07:43,177 INFO L87 Difference]: Start difference. First operand 303 states and 328 transitions. Second operand 9 states. [2018-02-02 09:07:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:43,204 INFO L93 Difference]: Finished difference Result 327 states and 352 transitions. [2018-02-02 09:07:43,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:07:43,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-02-02 09:07:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:43,207 INFO L225 Difference]: With dead ends: 327 [2018-02-02 09:07:43,207 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 09:07:43,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:07:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 09:07:43,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2018-02-02 09:07:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-02 09:07:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 342 transitions. [2018-02-02 09:07:43,213 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 342 transitions. Word has length 80 [2018-02-02 09:07:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:43,213 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 342 transitions. [2018-02-02 09:07:43,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:07:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 342 transitions. [2018-02-02 09:07:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 09:07:43,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:43,214 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:43,215 INFO L371 AbstractCegarLoop]: === Iteration 20 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1333480917, now seen corresponding path program 2 times [2018-02-02 09:07:43,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:43,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:43,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:43,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:43,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:43,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:43,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:43,299 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:43,306 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:07:43,328 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:07:43,331 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:07:43,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:43,403 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= (select (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true [2018-02-02 09:07:43,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:43,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-02-02 09:07:43,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:43,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:43,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36 [2018-02-02 09:07:43,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:43,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:43,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:43,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:43,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:43,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:43,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 09:07:43,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:43,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:07:43,533 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-02-02 09:07:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-02-02 09:07:43,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:07:43,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17 [2018-02-02 09:07:43,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:07:43,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:07:43,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=187, Unknown=2, NotChecked=28, Total=272 [2018-02-02 09:07:43,595 INFO L87 Difference]: Start difference. First operand 317 states and 342 transitions. Second operand 17 states. [2018-02-02 09:07:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:44,447 INFO L93 Difference]: Finished difference Result 371 states and 397 transitions. [2018-02-02 09:07:44,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:07:44,448 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-02-02 09:07:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:44,449 INFO L225 Difference]: With dead ends: 371 [2018-02-02 09:07:44,449 INFO L226 Difference]: Without dead ends: 371 [2018-02-02 09:07:44,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=484, Unknown=37, NotChecked=48, Total=702 [2018-02-02 09:07:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-02 09:07:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 345. [2018-02-02 09:07:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-02 09:07:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 374 transitions. [2018-02-02 09:07:44,456 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 374 transitions. Word has length 87 [2018-02-02 09:07:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:44,457 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 374 transitions. [2018-02-02 09:07:44,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:07:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 374 transitions. [2018-02-02 09:07:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 09:07:44,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:44,458 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:44,458 INFO L371 AbstractCegarLoop]: === Iteration 21 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1993221762, now seen corresponding path program 1 times [2018-02-02 09:07:44,458 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:44,458 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:44,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,459 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:07:44,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:44,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-02-02 09:07:44,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:44,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:44,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:44,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:44,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:44,510 INFO L87 Difference]: Start difference. First operand 345 states and 374 transitions. Second operand 4 states. [2018-02-02 09:07:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:44,525 INFO L93 Difference]: Finished difference Result 353 states and 378 transitions. [2018-02-02 09:07:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:07:44,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-02-02 09:07:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:44,527 INFO L225 Difference]: With dead ends: 353 [2018-02-02 09:07:44,528 INFO L226 Difference]: Without dead ends: 353 [2018-02-02 09:07:44,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-02 09:07:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2018-02-02 09:07:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-02 09:07:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 376 transitions. [2018-02-02 09:07:44,539 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 376 transitions. Word has length 96 [2018-02-02 09:07:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:44,539 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 376 transitions. [2018-02-02 09:07:44,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 376 transitions. [2018-02-02 09:07:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 09:07:44,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:44,540 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:44,540 INFO L371 AbstractCegarLoop]: === Iteration 22 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:44,541 INFO L82 PathProgramCache]: Analyzing trace with hash -550586226, now seen corresponding path program 1 times [2018-02-02 09:07:44,541 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:44,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:44,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:44,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:44,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:44,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:44,652 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:44,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:44,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:44,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:44,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-02-02 09:07:44,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:07:44,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:07:44,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:07:44,751 INFO L87 Difference]: Start difference. First operand 351 states and 376 transitions. Second operand 11 states. [2018-02-02 09:07:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:44,817 INFO L93 Difference]: Finished difference Result 375 states and 400 transitions. [2018-02-02 09:07:44,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:07:44,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-02-02 09:07:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:44,821 INFO L225 Difference]: With dead ends: 375 [2018-02-02 09:07:44,821 INFO L226 Difference]: Without dead ends: 375 [2018-02-02 09:07:44,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:07:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-02-02 09:07:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 365. [2018-02-02 09:07:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-02 09:07:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 390 transitions. [2018-02-02 09:07:44,827 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 390 transitions. Word has length 96 [2018-02-02 09:07:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:44,827 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 390 transitions. [2018-02-02 09:07:44,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:07:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 390 transitions. [2018-02-02 09:07:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 09:07:44,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:44,828 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:44,828 INFO L371 AbstractCegarLoop]: === Iteration 23 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:44,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1634312185, now seen corresponding path program 2 times [2018-02-02 09:07:44,829 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:44,829 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:44,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:44,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:44,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:44,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:44,931 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:44,939 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:07:44,967 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:07:44,971 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:07:44,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:45,002 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc3.base| 1)))) is different from true [2018-02-02 09:07:45,006 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1)))) is different from true [2018-02-02 09:07:45,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:45,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:45,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-02-02 09:07:45,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-02-02 09:07:45,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:07:45,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-02-02 09:07:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-02-02 09:07:45,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:07:45,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2018-02-02 09:07:45,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:07:45,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:07:45,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=122, Unknown=2, NotChecked=50, Total=240 [2018-02-02 09:07:45,150 INFO L87 Difference]: Start difference. First operand 365 states and 390 transitions. Second operand 16 states. [2018-02-02 09:07:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:45,612 INFO L93 Difference]: Finished difference Result 397 states and 423 transitions. [2018-02-02 09:07:45,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:07:45,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-02-02 09:07:45,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:45,613 INFO L225 Difference]: With dead ends: 397 [2018-02-02 09:07:45,613 INFO L226 Difference]: Without dead ends: 397 [2018-02-02 09:07:45,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=302, Unknown=47, NotChecked=86, Total=600 [2018-02-02 09:07:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-02 09:07:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 383. [2018-02-02 09:07:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 09:07:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 410 transitions. [2018-02-02 09:07:45,621 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 410 transitions. Word has length 103 [2018-02-02 09:07:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:45,621 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 410 transitions. [2018-02-02 09:07:45,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:07:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 410 transitions. [2018-02-02 09:07:45,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 09:07:45,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:45,622 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:45,623 INFO L371 AbstractCegarLoop]: === Iteration 24 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:45,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1686805039, now seen corresponding path program 1 times [2018-02-02 09:07:45,623 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:45,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:45,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:45,624 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:07:45,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:45,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:45,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:45,746 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:45,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:45,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:45,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:45,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-02-02 09:07:45,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:07:45,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:07:45,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:07:45,845 INFO L87 Difference]: Start difference. First operand 383 states and 410 transitions. Second operand 13 states. [2018-02-02 09:07:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:45,887 INFO L93 Difference]: Finished difference Result 407 states and 434 transitions. [2018-02-02 09:07:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:07:45,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2018-02-02 09:07:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:45,901 INFO L225 Difference]: With dead ends: 407 [2018-02-02 09:07:45,901 INFO L226 Difference]: Without dead ends: 407 [2018-02-02 09:07:45,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:07:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-02-02 09:07:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 397. [2018-02-02 09:07:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-02 09:07:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 424 transitions. [2018-02-02 09:07:45,908 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 424 transitions. Word has length 110 [2018-02-02 09:07:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:45,908 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 424 transitions. [2018-02-02 09:07:45,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:07:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 424 transitions. [2018-02-02 09:07:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 09:07:45,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:45,909 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:45,909 INFO L371 AbstractCegarLoop]: === Iteration 25 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash 81439322, now seen corresponding path program 2 times [2018-02-02 09:07:45,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:45,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:45,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:45,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:45,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:45,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:46,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:46,030 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:46,037 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:07:46,063 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:07:46,069 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:07:46,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:46,124 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= (select (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true [2018-02-02 09:07:46,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:46,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-02-02 09:07:46,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:46,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:46,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36 [2018-02-02 09:07:46,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:46,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:46,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:46,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:46,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 09:07:46,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:07:46,239 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-02-02 09:07:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-02-02 09:07:46,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:07:46,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2018-02-02 09:07:46,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:07:46,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:07:46,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=217, Unknown=2, NotChecked=32, Total=342 [2018-02-02 09:07:46,347 INFO L87 Difference]: Start difference. First operand 397 states and 424 transitions. Second operand 19 states. [2018-02-02 09:07:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:47,263 INFO L93 Difference]: Finished difference Result 422 states and 448 transitions. [2018-02-02 09:07:47,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:07:47,264 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 117 [2018-02-02 09:07:47,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:47,265 INFO L225 Difference]: With dead ends: 422 [2018-02-02 09:07:47,265 INFO L226 Difference]: Without dead ends: 422 [2018-02-02 09:07:47,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=557, Unknown=79, NotChecked=56, Total=930 [2018-02-02 09:07:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-02 09:07:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 410. [2018-02-02 09:07:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 09:07:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 435 transitions. [2018-02-02 09:07:47,272 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 435 transitions. Word has length 117 [2018-02-02 09:07:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:47,272 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 435 transitions. [2018-02-02 09:07:47,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:07:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 435 transitions. [2018-02-02 09:07:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-02 09:07:47,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:47,274 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:47,274 INFO L371 AbstractCegarLoop]: === Iteration 26 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash 371670050, now seen corresponding path program 1 times [2018-02-02 09:07:47,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:47,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:47,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,275 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:07:47,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:47,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-02-02 09:07:47,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:47,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:07:47,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:07:47,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:07:47,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:07:47,357 INFO L87 Difference]: Start difference. First operand 410 states and 435 transitions. Second operand 6 states. [2018-02-02 09:07:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:47,454 INFO L93 Difference]: Finished difference Result 450 states and 479 transitions. [2018-02-02 09:07:47,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:07:47,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-02-02 09:07:47,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:47,455 INFO L225 Difference]: With dead ends: 450 [2018-02-02 09:07:47,456 INFO L226 Difference]: Without dead ends: 450 [2018-02-02 09:07:47,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:07:47,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-02-02 09:07:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 418. [2018-02-02 09:07:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-02-02 09:07:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 443 transitions. [2018-02-02 09:07:47,460 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 443 transitions. Word has length 124 [2018-02-02 09:07:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:47,460 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 443 transitions. [2018-02-02 09:07:47,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:07:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 443 transitions. [2018-02-02 09:07:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-02-02 09:07:47,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:47,461 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:47,461 INFO L371 AbstractCegarLoop]: === Iteration 27 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:47,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1058519163, now seen corresponding path program 1 times [2018-02-02 09:07:47,462 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:47,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:47,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:47,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:47,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:47,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:47,595 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:47,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:47,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:47,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:47,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-02 09:07:47,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:07:47,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:07:47,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:07:47,703 INFO L87 Difference]: Start difference. First operand 418 states and 443 transitions. Second operand 15 states. [2018-02-02 09:07:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:47,759 INFO L93 Difference]: Finished difference Result 442 states and 467 transitions. [2018-02-02 09:07:47,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:07:47,767 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 126 [2018-02-02 09:07:47,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:47,769 INFO L225 Difference]: With dead ends: 442 [2018-02-02 09:07:47,769 INFO L226 Difference]: Without dead ends: 442 [2018-02-02 09:07:47,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:07:47,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-02 09:07:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 432. [2018-02-02 09:07:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-02-02 09:07:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 457 transitions. [2018-02-02 09:07:47,776 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 457 transitions. Word has length 126 [2018-02-02 09:07:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:47,777 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 457 transitions. [2018-02-02 09:07:47,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:07:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 457 transitions. [2018-02-02 09:07:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-02 09:07:47,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:47,778 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:47,778 INFO L371 AbstractCegarLoop]: === Iteration 28 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:47,778 INFO L82 PathProgramCache]: Analyzing trace with hash -341794384, now seen corresponding path program 2 times [2018-02-02 09:07:47,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:47,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:47,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:47,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:47,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:47,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:47,958 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:47,966 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:07:48,000 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:07:48,004 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:07:48,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:48,009 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-02-02 09:07:48,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:48,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:48,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:07:48,035 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc3.base| 1)))) is different from true [2018-02-02 09:07:48,038 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1)))) is different from true [2018-02-02 09:07:48,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:48,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:48,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-02-02 09:07:48,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-02-02 09:07:48,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:48,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:48,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:07:48,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-02-02 09:07:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-02-02 09:07:48,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:07:48,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2018-02-02 09:07:48,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:07:48,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:07:48,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=230, Unknown=2, NotChecked=70, Total=420 [2018-02-02 09:07:48,218 INFO L87 Difference]: Start difference. First operand 432 states and 457 transitions. Second operand 21 states. [2018-02-02 09:07:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:48,795 INFO L93 Difference]: Finished difference Result 486 states and 516 transitions. [2018-02-02 09:07:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:07:48,796 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 133 [2018-02-02 09:07:48,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:48,797 INFO L225 Difference]: With dead ends: 486 [2018-02-02 09:07:48,797 INFO L226 Difference]: Without dead ends: 486 [2018-02-02 09:07:48,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=654, Unknown=93, NotChecked=126, Total=1190 [2018-02-02 09:07:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-02-02 09:07:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 457. [2018-02-02 09:07:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-02-02 09:07:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 485 transitions. [2018-02-02 09:07:48,805 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 485 transitions. Word has length 133 [2018-02-02 09:07:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:48,806 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 485 transitions. [2018-02-02 09:07:48,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:07:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 485 transitions. [2018-02-02 09:07:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-02-02 09:07:48,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:48,807 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:48,807 INFO L371 AbstractCegarLoop]: === Iteration 29 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1585549606, now seen corresponding path program 1 times [2018-02-02 09:07:48,807 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:48,807 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:48,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:48,808 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:07:48,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:48,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:49,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:49,018 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:49,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:49,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:49,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:49,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-02 09:07:49,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:07:49,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:07:49,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:07:49,099 INFO L87 Difference]: Start difference. First operand 457 states and 485 transitions. Second operand 17 states. [2018-02-02 09:07:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:49,143 INFO L93 Difference]: Finished difference Result 481 states and 509 transitions. [2018-02-02 09:07:49,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:07:49,146 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 140 [2018-02-02 09:07:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:49,148 INFO L225 Difference]: With dead ends: 481 [2018-02-02 09:07:49,148 INFO L226 Difference]: Without dead ends: 481 [2018-02-02 09:07:49,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:07:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-02-02 09:07:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 471. [2018-02-02 09:07:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-02 09:07:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 499 transitions. [2018-02-02 09:07:49,158 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 499 transitions. Word has length 140 [2018-02-02 09:07:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:49,162 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 499 transitions. [2018-02-02 09:07:49,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:07:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 499 transitions. [2018-02-02 09:07:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 09:07:49,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:49,163 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:49,163 INFO L371 AbstractCegarLoop]: === Iteration 30 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:49,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1569766383, now seen corresponding path program 2 times [2018-02-02 09:07:49,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:49,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:49,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:49,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:49,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:49,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:49,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:49,363 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:49,373 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:07:49,404 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:07:49,409 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:07:49,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:49,503 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= (select (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true [2018-02-02 09:07:49,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:49,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-02-02 09:07:49,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:49,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:49,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36 [2018-02-02 09:07:49,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:49,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:49,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:49,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:49,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:49,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:49,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 09:07:49,632 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:49,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:07:49,642 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-02-02 09:07:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2018-02-02 09:07:49,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:07:49,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2018-02-02 09:07:49,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 09:07:49,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 09:07:49,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=399, Unknown=2, NotChecked=44, Total=600 [2018-02-02 09:07:49,801 INFO L87 Difference]: Start difference. First operand 471 states and 499 transitions. Second operand 25 states. [2018-02-02 09:07:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:50,634 INFO L93 Difference]: Finished difference Result 513 states and 543 transitions. [2018-02-02 09:07:50,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:07:50,634 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 147 [2018-02-02 09:07:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:50,635 INFO L225 Difference]: With dead ends: 513 [2018-02-02 09:07:50,635 INFO L226 Difference]: Without dead ends: 513 [2018-02-02 09:07:50,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=1238, Unknown=137, NotChecked=82, Total=1892 [2018-02-02 09:07:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-02-02 09:07:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 485. [2018-02-02 09:07:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-02-02 09:07:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 512 transitions. [2018-02-02 09:07:50,642 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 512 transitions. Word has length 147 [2018-02-02 09:07:50,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:50,642 INFO L432 AbstractCegarLoop]: Abstraction has 485 states and 512 transitions. [2018-02-02 09:07:50,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 09:07:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 512 transitions. [2018-02-02 09:07:50,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-02-02 09:07:50,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:50,644 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:50,644 INFO L371 AbstractCegarLoop]: === Iteration 31 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:50,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1299860795, now seen corresponding path program 1 times [2018-02-02 09:07:50,644 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:50,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:50,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:50,645 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:07:50,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:50,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2018-02-02 09:07:50,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:50,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:50,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:07:50,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:07:50,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:50,723 INFO L87 Difference]: Start difference. First operand 485 states and 512 transitions. Second operand 5 states. [2018-02-02 09:07:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:50,863 INFO L93 Difference]: Finished difference Result 484 states and 511 transitions. [2018-02-02 09:07:50,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:07:50,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-02-02 09:07:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:50,865 INFO L225 Difference]: With dead ends: 484 [2018-02-02 09:07:50,865 INFO L226 Difference]: Without dead ends: 484 [2018-02-02 09:07:50,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:07:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-02-02 09:07:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2018-02-02 09:07:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-02-02 09:07:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 511 transitions. [2018-02-02 09:07:50,871 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 511 transitions. Word has length 155 [2018-02-02 09:07:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:50,871 INFO L432 AbstractCegarLoop]: Abstraction has 484 states and 511 transitions. [2018-02-02 09:07:50,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:07:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 511 transitions. [2018-02-02 09:07:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-02-02 09:07:50,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:50,872 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:50,872 INFO L371 AbstractCegarLoop]: === Iteration 32 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:50,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1299860794, now seen corresponding path program 1 times [2018-02-02 09:07:50,873 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:50,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:50,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:50,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:50,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:50,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:51,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:51,097 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:51,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:51,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:51,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:51,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-02 09:07:51,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:07:51,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:07:51,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:07:51,204 INFO L87 Difference]: Start difference. First operand 484 states and 511 transitions. Second operand 19 states. [2018-02-02 09:07:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:51,253 INFO L93 Difference]: Finished difference Result 508 states and 535 transitions. [2018-02-02 09:07:51,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:07:51,254 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 155 [2018-02-02 09:07:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:51,256 INFO L225 Difference]: With dead ends: 508 [2018-02-02 09:07:51,256 INFO L226 Difference]: Without dead ends: 508 [2018-02-02 09:07:51,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:07:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-02-02 09:07:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 498. [2018-02-02 09:07:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-02-02 09:07:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 525 transitions. [2018-02-02 09:07:51,263 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 525 transitions. Word has length 155 [2018-02-02 09:07:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:51,263 INFO L432 AbstractCegarLoop]: Abstraction has 498 states and 525 transitions. [2018-02-02 09:07:51,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:07:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 525 transitions. [2018-02-02 09:07:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 09:07:51,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:51,265 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:51,265 INFO L371 AbstractCegarLoop]: === Iteration 33 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash -198939525, now seen corresponding path program 2 times [2018-02-02 09:07:51,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:51,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:51,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:51,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:51,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:51,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:51,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:51,496 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:51,500 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:07:51,521 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:07:51,524 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:07:51,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2018-02-02 09:07:51,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:07:51,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 24 [2018-02-02 09:07:51,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 09:07:51,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 09:07:51,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:07:51,607 INFO L87 Difference]: Start difference. First operand 498 states and 525 transitions. Second operand 24 states. [2018-02-02 09:07:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:51,908 INFO L93 Difference]: Finished difference Result 515 states and 542 transitions. [2018-02-02 09:07:51,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:07:51,908 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 162 [2018-02-02 09:07:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:51,909 INFO L225 Difference]: With dead ends: 515 [2018-02-02 09:07:51,909 INFO L226 Difference]: Without dead ends: 515 [2018-02-02 09:07:51,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:07:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-02-02 09:07:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 505. [2018-02-02 09:07:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-02-02 09:07:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 532 transitions. [2018-02-02 09:07:51,917 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 532 transitions. Word has length 162 [2018-02-02 09:07:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:51,917 INFO L432 AbstractCegarLoop]: Abstraction has 505 states and 532 transitions. [2018-02-02 09:07:51,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 09:07:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 532 transitions. [2018-02-02 09:07:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-02-02 09:07:51,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:51,918 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:07:51,919 INFO L371 AbstractCegarLoop]: === Iteration 34 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:51,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1667147789, now seen corresponding path program 1 times [2018-02-02 09:07:51,919 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:51,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:51,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:51,920 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:07:51,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:51,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:52,044 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2018-02-02 09:07:52,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:52,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:07:52,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:07:52,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:07:52,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:07:52,045 INFO L87 Difference]: Start difference. First operand 505 states and 532 transitions. Second operand 7 states. [2018-02-02 09:07:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:52,206 INFO L93 Difference]: Finished difference Result 519 states and 548 transitions. [2018-02-02 09:07:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:07:52,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2018-02-02 09:07:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:52,208 INFO L225 Difference]: With dead ends: 519 [2018-02-02 09:07:52,208 INFO L226 Difference]: Without dead ends: 519 [2018-02-02 09:07:52,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:07:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-02-02 09:07:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 504. [2018-02-02 09:07:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-02-02 09:07:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 531 transitions. [2018-02-02 09:07:52,214 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 531 transitions. Word has length 170 [2018-02-02 09:07:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:52,214 INFO L432 AbstractCegarLoop]: Abstraction has 504 states and 531 transitions. [2018-02-02 09:07:52,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:07:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 531 transitions. [2018-02-02 09:07:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-02-02 09:07:52,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:52,215 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:07:52,215 INFO L371 AbstractCegarLoop]: === Iteration 35 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:52,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1667147788, now seen corresponding path program 1 times [2018-02-02 09:07:52,216 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:52,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:52,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:52,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:52,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:52,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:52,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:52,462 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:52,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:52,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:52,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:52,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-02-02 09:07:52,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:07:52,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:07:52,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:07:52,561 INFO L87 Difference]: Start difference. First operand 504 states and 531 transitions. Second operand 21 states. [2018-02-02 09:07:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:52,609 INFO L93 Difference]: Finished difference Result 528 states and 555 transitions. [2018-02-02 09:07:52,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:07:52,609 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 170 [2018-02-02 09:07:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:52,610 INFO L225 Difference]: With dead ends: 528 [2018-02-02 09:07:52,610 INFO L226 Difference]: Without dead ends: 528 [2018-02-02 09:07:52,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:07:52,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-02-02 09:07:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 518. [2018-02-02 09:07:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-02-02 09:07:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 545 transitions. [2018-02-02 09:07:52,615 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 545 transitions. Word has length 170 [2018-02-02 09:07:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:52,616 INFO L432 AbstractCegarLoop]: Abstraction has 518 states and 545 transitions. [2018-02-02 09:07:52,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:07:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 545 transitions. [2018-02-02 09:07:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-02 09:07:52,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:52,616 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:07:52,617 INFO L371 AbstractCegarLoop]: === Iteration 36 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:52,617 INFO L82 PathProgramCache]: Analyzing trace with hash 280714655, now seen corresponding path program 2 times [2018-02-02 09:07:52,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:52,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:52,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:52,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:52,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:52,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:52,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:52,918 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:52,922 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:07:52,946 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:07:52,949 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:07:52,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:53,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:07:53,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:07:53,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:53,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:53,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:07:53,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:07:53,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:53,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:53,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:53,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:23 [2018-02-02 09:07:53,048 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 23 treesize of output 19 [2018-02-02 09:07:53,050 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 19 treesize of output 11 [2018-02-02 09:07:53,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:53,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:53,055 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 26 treesize of output 20 [2018-02-02 09:07:53,056 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 20 treesize of output 11 [2018-02-02 09:07:53,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:53,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:53,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:53,061 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-02-02 09:07:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2018-02-02 09:07:53,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:07:53,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 27 [2018-02-02 09:07:53,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 09:07:53,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 09:07:53,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:07:53,103 INFO L87 Difference]: Start difference. First operand 518 states and 545 transitions. Second operand 27 states. [2018-02-02 09:07:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:53,469 INFO L93 Difference]: Finished difference Result 566 states and 595 transitions. [2018-02-02 09:07:53,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 09:07:53,469 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 177 [2018-02-02 09:07:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:53,470 INFO L225 Difference]: With dead ends: 566 [2018-02-02 09:07:53,470 INFO L226 Difference]: Without dead ends: 566 [2018-02-02 09:07:53,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:07:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-02-02 09:07:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 531. [2018-02-02 09:07:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-02-02 09:07:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 558 transitions. [2018-02-02 09:07:53,476 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 558 transitions. Word has length 177 [2018-02-02 09:07:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:53,477 INFO L432 AbstractCegarLoop]: Abstraction has 531 states and 558 transitions. [2018-02-02 09:07:53,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 09:07:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 558 transitions. [2018-02-02 09:07:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-02 09:07:53,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:53,478 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:07:53,478 INFO L371 AbstractCegarLoop]: === Iteration 37 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:53,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1058140492, now seen corresponding path program 1 times [2018-02-02 09:07:53,478 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:53,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:53,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:53,479 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:07:53,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:53,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:53,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:53,771 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:07:53,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:53,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:53,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:53,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-02-02 09:07:53,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 09:07:53,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 09:07:53,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:07:53,881 INFO L87 Difference]: Start difference. First operand 531 states and 558 transitions. Second operand 23 states. [2018-02-02 09:07:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:53,946 INFO L93 Difference]: Finished difference Result 545 states and 572 transitions. [2018-02-02 09:07:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:07:53,946 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 184 [2018-02-02 09:07:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:53,947 INFO L225 Difference]: With dead ends: 545 [2018-02-02 09:07:53,947 INFO L226 Difference]: Without dead ends: 545 [2018-02-02 09:07:53,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:07:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-02-02 09:07:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2018-02-02 09:07:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-02-02 09:07:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 572 transitions. [2018-02-02 09:07:53,952 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 572 transitions. Word has length 184 [2018-02-02 09:07:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:53,953 INFO L432 AbstractCegarLoop]: Abstraction has 545 states and 572 transitions. [2018-02-02 09:07:53,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 09:07:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 572 transitions. [2018-02-02 09:07:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-02 09:07:53,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:53,954 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:07:53,954 INFO L371 AbstractCegarLoop]: === Iteration 38 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:53,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1311460639, now seen corresponding path program 2 times [2018-02-02 09:07:53,955 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:53,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:53,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:53,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:53,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:54,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:07:54,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:54,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:07:54,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:07:54,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:07:54,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:07:54,397 INFO L87 Difference]: Start difference. First operand 545 states and 572 transitions. Second operand 8 states. [2018-02-02 09:07:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:54,840 INFO L93 Difference]: Finished difference Result 563 states and 589 transitions. [2018-02-02 09:07:54,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:07:54,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2018-02-02 09:07:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:54,841 INFO L225 Difference]: With dead ends: 563 [2018-02-02 09:07:54,841 INFO L226 Difference]: Without dead ends: 563 [2018-02-02 09:07:54,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:07:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-02-02 09:07:54,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 556. [2018-02-02 09:07:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-02-02 09:07:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 587 transitions. [2018-02-02 09:07:54,846 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 587 transitions. Word has length 191 [2018-02-02 09:07:54,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:54,847 INFO L432 AbstractCegarLoop]: Abstraction has 556 states and 587 transitions. [2018-02-02 09:07:54,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:07:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 587 transitions. [2018-02-02 09:07:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-02 09:07:54,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:54,848 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:07:54,848 INFO L371 AbstractCegarLoop]: === Iteration 39 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:54,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1311460640, now seen corresponding path program 1 times [2018-02-02 09:07:54,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:54,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:54,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:54,849 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:07:54,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:55,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:07:55,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:55,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:07:55,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:07:55,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:07:55,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:07:55,641 INFO L87 Difference]: Start difference. First operand 556 states and 587 transitions. Second operand 12 states. [2018-02-02 09:07:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:56,208 INFO L93 Difference]: Finished difference Result 562 states and 587 transitions. [2018-02-02 09:07:56,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:07:56,209 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 191 [2018-02-02 09:07:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:56,210 INFO L225 Difference]: With dead ends: 562 [2018-02-02 09:07:56,210 INFO L226 Difference]: Without dead ends: 562 [2018-02-02 09:07:56,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:07:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-02-02 09:07:56,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 544. [2018-02-02 09:07:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-02-02 09:07:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 572 transitions. [2018-02-02 09:07:56,214 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 572 transitions. Word has length 191 [2018-02-02 09:07:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:56,214 INFO L432 AbstractCegarLoop]: Abstraction has 544 states and 572 transitions. [2018-02-02 09:07:56,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:07:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 572 transitions. [2018-02-02 09:07:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-02 09:07:56,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:56,215 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:07:56,215 INFO L371 AbstractCegarLoop]: === Iteration 40 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:56,215 INFO L82 PathProgramCache]: Analyzing trace with hash -166105366, now seen corresponding path program 1 times [2018-02-02 09:07:56,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:56,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:56,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:56,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:56,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:56,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:07:56,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:56,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:07:56,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:07:56,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:07:56,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:07:56,917 INFO L87 Difference]: Start difference. First operand 544 states and 572 transitions. Second operand 13 states. [2018-02-02 09:07:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:57,687 INFO L93 Difference]: Finished difference Result 546 states and 571 transitions. [2018-02-02 09:07:57,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:07:57,687 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194 [2018-02-02 09:07:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:57,689 INFO L225 Difference]: With dead ends: 546 [2018-02-02 09:07:57,689 INFO L226 Difference]: Without dead ends: 546 [2018-02-02 09:07:57,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:07:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-02 09:07:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 542. [2018-02-02 09:07:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-02-02 09:07:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 567 transitions. [2018-02-02 09:07:57,692 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 567 transitions. Word has length 194 [2018-02-02 09:07:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:57,693 INFO L432 AbstractCegarLoop]: Abstraction has 542 states and 567 transitions. [2018-02-02 09:07:57,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:07:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 567 transitions. [2018-02-02 09:07:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-02 09:07:57,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:57,693 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:07:57,694 INFO L371 AbstractCegarLoop]: === Iteration 41 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash -166105365, now seen corresponding path program 1 times [2018-02-02 09:07:57,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:57,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:57,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:57,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:57,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:58,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:07:58,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:58,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:07:58,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:07:58,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:07:58,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:07:58,656 INFO L87 Difference]: Start difference. First operand 542 states and 567 transitions. Second operand 13 states. [2018-02-02 09:07:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:59,094 INFO L93 Difference]: Finished difference Result 544 states and 566 transitions. [2018-02-02 09:07:59,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:07:59,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194 [2018-02-02 09:07:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:59,095 INFO L225 Difference]: With dead ends: 544 [2018-02-02 09:07:59,095 INFO L226 Difference]: Without dead ends: 544 [2018-02-02 09:07:59,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:07:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-02-02 09:07:59,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 523. [2018-02-02 09:07:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-02-02 09:07:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 543 transitions. [2018-02-02 09:07:59,099 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 543 transitions. Word has length 194 [2018-02-02 09:07:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:59,099 INFO L432 AbstractCegarLoop]: Abstraction has 523 states and 543 transitions. [2018-02-02 09:07:59,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:07:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 543 transitions. [2018-02-02 09:07:59,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-02 09:07:59,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:59,100 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:07:59,100 INFO L371 AbstractCegarLoop]: === Iteration 42 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:59,101 INFO L82 PathProgramCache]: Analyzing trace with hash -326265980, now seen corresponding path program 1 times [2018-02-02 09:07:59,101 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:59,101 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:59,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:59,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:59,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:59,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:07:59,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:59,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:59,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:07:59,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:07:59,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:59,194 INFO L87 Difference]: Start difference. First operand 523 states and 543 transitions. Second operand 5 states. [2018-02-02 09:07:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:59,318 INFO L93 Difference]: Finished difference Result 538 states and 560 transitions. [2018-02-02 09:07:59,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:07:59,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-02-02 09:07:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:59,321 INFO L225 Difference]: With dead ends: 538 [2018-02-02 09:07:59,321 INFO L226 Difference]: Without dead ends: 538 [2018-02-02 09:07:59,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:07:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-02-02 09:07:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 522. [2018-02-02 09:07:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-02-02 09:07:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 542 transitions. [2018-02-02 09:07:59,326 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 542 transitions. Word has length 195 [2018-02-02 09:07:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:59,326 INFO L432 AbstractCegarLoop]: Abstraction has 522 states and 542 transitions. [2018-02-02 09:07:59,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:07:59,326 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 542 transitions. [2018-02-02 09:07:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-02 09:07:59,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:59,327 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:07:59,327 INFO L371 AbstractCegarLoop]: === Iteration 43 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:59,327 INFO L82 PathProgramCache]: Analyzing trace with hash -326265979, now seen corresponding path program 1 times [2018-02-02 09:07:59,327 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:59,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:59,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:59,328 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:59,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:59,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:07:59,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:59,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:07:59,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:07:59,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:07:59,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:07:59,826 INFO L87 Difference]: Start difference. First operand 522 states and 542 transitions. Second operand 10 states. [2018-02-02 09:08:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:00,017 INFO L93 Difference]: Finished difference Result 547 states and 569 transitions. [2018-02-02 09:08:00,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:08:00,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-02-02 09:08:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:00,019 INFO L225 Difference]: With dead ends: 547 [2018-02-02 09:08:00,019 INFO L226 Difference]: Without dead ends: 547 [2018-02-02 09:08:00,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:08:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-02-02 09:08:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 521. [2018-02-02 09:08:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-02-02 09:08:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 541 transitions. [2018-02-02 09:08:00,022 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 541 transitions. Word has length 195 [2018-02-02 09:08:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:00,023 INFO L432 AbstractCegarLoop]: Abstraction has 521 states and 541 transitions. [2018-02-02 09:08:00,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:08:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 541 transitions. [2018-02-02 09:08:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 09:08:00,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:00,024 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:08:00,024 INFO L371 AbstractCegarLoop]: === Iteration 44 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:00,024 INFO L82 PathProgramCache]: Analyzing trace with hash -713459111, now seen corresponding path program 1 times [2018-02-02 09:08:00,024 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:00,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:00,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:00,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:00,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:00,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:08:01,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:01,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:08:01,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:08:01,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:08:01,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:08:01,338 INFO L87 Difference]: Start difference. First operand 521 states and 541 transitions. Second operand 13 states. [2018-02-02 09:08:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:02,611 INFO L93 Difference]: Finished difference Result 527 states and 547 transitions. [2018-02-02 09:08:02,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:08:02,612 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 196 [2018-02-02 09:08:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:02,613 INFO L225 Difference]: With dead ends: 527 [2018-02-02 09:08:02,613 INFO L226 Difference]: Without dead ends: 527 [2018-02-02 09:08:02,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:08:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-02-02 09:08:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 520. [2018-02-02 09:08:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-02-02 09:08:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 540 transitions. [2018-02-02 09:08:02,616 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 540 transitions. Word has length 196 [2018-02-02 09:08:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:02,616 INFO L432 AbstractCegarLoop]: Abstraction has 520 states and 540 transitions. [2018-02-02 09:08:02,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:08:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 540 transitions. [2018-02-02 09:08:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 09:08:02,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:02,617 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:08:02,617 INFO L371 AbstractCegarLoop]: === Iteration 45 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash -713459110, now seen corresponding path program 1 times [2018-02-02 09:08:02,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:02,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:02,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:02,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:02,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:02,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 16 proven. 921 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-02-02 09:08:05,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:08:05,019 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:08:05,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:05,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:08:05,104 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-02-02 09:08:05,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 09:08:05,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-02-02 09:08:05,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-02 09:08:05,461 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 13 treesize of output 10 [2018-02-02 09:08:05,462 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 10 treesize of output 9 [2018-02-02 09:08:05,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-02-02 09:08:05,499 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 30 treesize of output 26 [2018-02-02 09:08:05,502 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-02-02 09:08:05,502 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:08:05,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:08:05,508 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-02-02 09:08:05,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:23 [2018-02-02 09:08:05,509 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_16 Int)) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_16 80) |c_#length|) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_16) 0))) is different from true [2018-02-02 09:08:05,600 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_16 Int)) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_16) 0) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_16 80) |c_create_data_#t~malloc22.base| 16)))) is different from true [2018-02-02 09:08:05,604 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_16 Int) (|create_data_#t~malloc22.base| Int)) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_16) 0) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_16 80) |create_data_#t~malloc22.base| 16)))) is different from true [2018-02-02 09:08:05,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:05,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:05,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:05,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 09:08:05,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-02-02 09:08:05,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:05,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-02-02 09:08:05,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 46 [2018-02-02 09:08:05,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-02 09:08:05,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:08:05,680 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:08:05,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-02 09:08:05,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:72 [2018-02-02 09:08:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1311 trivial. 59 not checked. [2018-02-02 09:08:05,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:08:05,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 35 [2018-02-02 09:08:05,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 09:08:05,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 09:08:05,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=922, Unknown=3, NotChecked=192, Total=1260 [2018-02-02 09:08:05,892 INFO L87 Difference]: Start difference. First operand 520 states and 540 transitions. Second operand 36 states. [2018-02-02 09:08:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:07,809 INFO L93 Difference]: Finished difference Result 527 states and 547 transitions. [2018-02-02 09:08:07,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:08:07,810 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 196 [2018-02-02 09:08:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:07,811 INFO L225 Difference]: With dead ends: 527 [2018-02-02 09:08:07,811 INFO L226 Difference]: Without dead ends: 527 [2018-02-02 09:08:07,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 208 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=263, Invalid=1907, Unknown=4, NotChecked=276, Total=2450 [2018-02-02 09:08:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-02-02 09:08:07,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 508. [2018-02-02 09:08:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-02 09:08:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 528 transitions. [2018-02-02 09:08:07,814 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 528 transitions. Word has length 196 [2018-02-02 09:08:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:07,814 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 528 transitions. [2018-02-02 09:08:07,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 09:08:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 528 transitions. [2018-02-02 09:08:07,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 09:08:07,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:07,815 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:08:07,815 INFO L371 AbstractCegarLoop]: === Iteration 46 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:07,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1524310655, now seen corresponding path program 1 times [2018-02-02 09:08:07,815 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:07,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:07,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:07,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:07,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:07,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:08:08,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:08,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 09:08:08,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:08:08,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:08:08,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:08:08,122 INFO L87 Difference]: Start difference. First operand 508 states and 528 transitions. Second operand 16 states. [2018-02-02 09:08:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:08,670 INFO L93 Difference]: Finished difference Result 551 states and 579 transitions. [2018-02-02 09:08:08,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:08:08,670 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 196 [2018-02-02 09:08:08,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:08,671 INFO L225 Difference]: With dead ends: 551 [2018-02-02 09:08:08,672 INFO L226 Difference]: Without dead ends: 551 [2018-02-02 09:08:08,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:08:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-02-02 09:08:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 503. [2018-02-02 09:08:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-02-02 09:08:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 524 transitions. [2018-02-02 09:08:08,676 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 524 transitions. Word has length 196 [2018-02-02 09:08:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:08,676 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 524 transitions. [2018-02-02 09:08:08,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:08:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 524 transitions. [2018-02-02 09:08:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 09:08:08,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:08,677 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:08:08,677 INFO L371 AbstractCegarLoop]: === Iteration 47 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:08,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1524310654, now seen corresponding path program 1 times [2018-02-02 09:08:08,677 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:08,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:08,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:08,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:08,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:08,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:08:09,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:09,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:08:09,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:08:09,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:08:09,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:08:09,146 INFO L87 Difference]: Start difference. First operand 503 states and 524 transitions. Second operand 18 states. [2018-02-02 09:08:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:09,799 INFO L93 Difference]: Finished difference Result 540 states and 566 transitions. [2018-02-02 09:08:09,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:08:09,799 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 196 [2018-02-02 09:08:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:09,800 INFO L225 Difference]: With dead ends: 540 [2018-02-02 09:08:09,800 INFO L226 Difference]: Without dead ends: 540 [2018-02-02 09:08:09,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:08:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-02-02 09:08:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 503. [2018-02-02 09:08:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-02-02 09:08:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 523 transitions. [2018-02-02 09:08:09,804 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 523 transitions. Word has length 196 [2018-02-02 09:08:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:09,804 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 523 transitions. [2018-02-02 09:08:09,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:08:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 523 transitions. [2018-02-02 09:08:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 09:08:09,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:09,805 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:08:09,805 INFO L371 AbstractCegarLoop]: === Iteration 48 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:09,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1813470134, now seen corresponding path program 1 times [2018-02-02 09:08:09,805 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:09,805 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:09,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:09,806 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:09,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:09,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:08:09,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:09,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:08:09,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:08:09,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:08:09,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:08:09,864 INFO L87 Difference]: Start difference. First operand 503 states and 523 transitions. Second operand 5 states. [2018-02-02 09:08:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:09,955 INFO L93 Difference]: Finished difference Result 517 states and 539 transitions. [2018-02-02 09:08:09,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:08:09,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2018-02-02 09:08:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:09,957 INFO L225 Difference]: With dead ends: 517 [2018-02-02 09:08:09,957 INFO L226 Difference]: Without dead ends: 517 [2018-02-02 09:08:09,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:08:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-02 09:08:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 508. [2018-02-02 09:08:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-02 09:08:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 530 transitions. [2018-02-02 09:08:09,960 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 530 transitions. Word has length 202 [2018-02-02 09:08:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:09,960 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 530 transitions. [2018-02-02 09:08:09,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:08:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 530 transitions. [2018-02-02 09:08:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 09:08:09,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:09,961 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:08:09,961 INFO L371 AbstractCegarLoop]: === Iteration 49 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1813470135, now seen corresponding path program 1 times [2018-02-02 09:08:09,961 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:09,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:09,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:09,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:09,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:09,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:10,305 WARN L143 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 12 [2018-02-02 09:08:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:08:10,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:10,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:08:10,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:08:10,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:08:10,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:08:10,512 INFO L87 Difference]: Start difference. First operand 508 states and 530 transitions. Second operand 17 states. [2018-02-02 09:08:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:11,177 INFO L93 Difference]: Finished difference Result 547 states and 574 transitions. [2018-02-02 09:08:11,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:08:11,177 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 202 [2018-02-02 09:08:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:11,178 INFO L225 Difference]: With dead ends: 547 [2018-02-02 09:08:11,178 INFO L226 Difference]: Without dead ends: 547 [2018-02-02 09:08:11,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 09:08:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-02-02 09:08:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 508. [2018-02-02 09:08:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-02 09:08:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 529 transitions. [2018-02-02 09:08:11,183 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 529 transitions. Word has length 202 [2018-02-02 09:08:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:11,183 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 529 transitions. [2018-02-02 09:08:11,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:08:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 529 transitions. [2018-02-02 09:08:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-02 09:08:11,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:11,184 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 09:08:11,184 INFO L371 AbstractCegarLoop]: === Iteration 50 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash -470384195, now seen corresponding path program 1 times [2018-02-02 09:08:11,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:11,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:11,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:11,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:11,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:11,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-02-02 09:08:12,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:12,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 09:08:12,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:08:12,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:08:12,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:08:12,308 INFO L87 Difference]: Start difference. First operand 508 states and 529 transitions. Second operand 19 states. [2018-02-02 09:08:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:13,374 INFO L93 Difference]: Finished difference Result 584 states and 616 transitions. [2018-02-02 09:08:13,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:08:13,375 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2018-02-02 09:08:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:13,376 INFO L225 Difference]: With dead ends: 584 [2018-02-02 09:08:13,376 INFO L226 Difference]: Without dead ends: 584 [2018-02-02 09:08:13,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:08:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-02-02 09:08:13,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 548. [2018-02-02 09:08:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-02-02 09:08:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 576 transitions. [2018-02-02 09:08:13,379 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 576 transitions. Word has length 206 [2018-02-02 09:08:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:13,380 INFO L432 AbstractCegarLoop]: Abstraction has 548 states and 576 transitions. [2018-02-02 09:08:13,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:08:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 576 transitions. [2018-02-02 09:08:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-02 09:08:13,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:13,380 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:08:13,380 INFO L371 AbstractCegarLoop]: === Iteration 51 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:13,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1090531839, now seen corresponding path program 1 times [2018-02-02 09:08:13,381 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:13,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:13,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:13,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:13,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order Received shutdown request... [2018-02-02 09:08:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-02-02 09:08:13,436 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 09:08:13,436 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 09:08:13,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:13,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:08:13,519 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 09:08:13,519 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:08:13,525 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:08:13,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:08:13 BoogieIcfgContainer [2018-02-02 09:08:13,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:08:13,526 INFO L168 Benchmark]: Toolchain (without parser) took 38402.39 ms. Allocated memory was 406.8 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 363.5 MB in the beginning and 813.4 MB in the end (delta: -449.8 MB). Peak memory consumption was 734.0 MB. Max. memory is 5.3 GB. [2018-02-02 09:08:13,529 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 406.8 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:08:13,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.66 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 350.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:08:13,530 INFO L168 Benchmark]: Boogie Preprocessor took 34.03 ms. Allocated memory is still 406.8 MB. Free memory is still 350.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:08:13,530 INFO L168 Benchmark]: RCFGBuilder took 521.17 ms. Allocated memory is still 406.8 MB. Free memory was 350.3 MB in the beginning and 296.0 MB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:08:13,530 INFO L168 Benchmark]: TraceAbstraction took 37656.14 ms. Allocated memory was 406.8 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 296.0 MB in the beginning and 813.4 MB in the end (delta: -517.3 MB). Peak memory consumption was 666.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:08:13,531 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.15 ms. Allocated memory is still 406.8 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 187.66 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 350.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.03 ms. Allocated memory is still 406.8 MB. Free memory is still 350.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 521.17 ms. Allocated memory is still 406.8 MB. Free memory was 350.3 MB in the beginning and 296.0 MB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 37656.14 ms. Allocated memory was 406.8 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 296.0 MB in the beginning and 813.4 MB in the end (delta: -517.3 MB). Peak memory consumption was 666.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 585]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 585). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 213 locations, 91 error locations. TIMEOUT Result, 37.6s OverallTime, 51 OverallIterations, 21 TraceHistogramMax, 18.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7588 SDtfs, 5904 SDslu, 39708 SDs, 0 SdLazy, 19595 SolverSat, 706 SolverUnsat, 121 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3191 GetRequests, 2425 SyntacticMatches, 30 SemanticMatches, 736 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=556occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 50 MinimizatonAttempts, 750 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 8059 NumberOfCodeBlocks, 7443 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 7989 ConstructedInterpolants, 686 QuantifiedInterpolants, 29524963 SizeOfPredicates, 69 NumberOfNonLiveVariables, 6884 ConjunctsInSsa, 307 ConjunctsInUnsatCore, 70 InterpolantComputations, 38 PerfectInterpolantSequences, 24420/38267 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test01_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-08-13-542.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test01_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-08-13-542.csv Completed graceful shutdown