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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0236_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:31:05,134 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:31:05,136 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:31:05,149 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:31:05,149 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:31:05,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:31:05,151 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:31:05,152 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:31:05,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:31:05,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:31:05,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:31:05,156 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:31:05,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:31:05,158 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:31:05,158 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:31:05,160 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:31:05,162 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:31:05,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:31:05,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:31:05,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:31:05,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:31:05,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:31:05,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:31:05,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:31:05,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:31:05,169 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:31:05,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:31:05,170 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:31:05,170 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:31:05,170 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:31:05,171 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:31:05,171 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:31:05,180 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:31:05,181 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:31:05,182 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:31:05,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:31:05,182 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:31:05,182 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:31:05,182 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:31:05,182 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:31:05,183 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:31:05,183 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:31:05,183 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:31:05,183 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:31:05,183 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:31:05,183 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:31:05,183 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:31:05,184 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:31:05,184 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:31:05,184 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:31:05,184 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:31:05,184 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:31:05,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:31:05,185 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:31:05,185 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:31:05,185 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:31:05,185 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:31:05,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:31:05,226 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:31:05,229 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:31:05,230 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:31:05,233 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:31:05,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0236_true-valid-memsafety.i [2018-02-03 23:31:05,381 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:31:05,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:31:05,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:31:05,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:31:05,388 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:31:05,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:31:05" (1/1) ... [2018-02-03 23:31:05,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a9abb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:05, skipping insertion in model container [2018-02-03 23:31:05,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:31:05" (1/1) ... [2018-02-03 23:31:05,406 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:31:05,439 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:31:05,533 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:31:05,549 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:31:05,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:05 WrapperNode [2018-02-03 23:31:05,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:31:05,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:31:05,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:31:05,559 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:31:05,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:05" (1/1) ... [2018-02-03 23:31:05,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:05" (1/1) ... [2018-02-03 23:31:05,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:05" (1/1) ... [2018-02-03 23:31:05,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:05" (1/1) ... [2018-02-03 23:31:05,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:05" (1/1) ... [2018-02-03 23:31:05,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:05" (1/1) ... [2018-02-03 23:31:05,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:05" (1/1) ... [2018-02-03 23:31:05,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:31:05,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:31:05,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:31:05,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:31:05,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:05" (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-03 23:31:05,624 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:31:05,624 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:31:05,624 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-03 23:31:05,624 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-03 23:31:05,624 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-03 23:31:05,624 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-03 23:31:05,624 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-03 23:31:05,625 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-03 23:31:05,625 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-03 23:31:05,625 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-03 23:31:05,625 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-03 23:31:05,625 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-03 23:31:05,625 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-03 23:31:05,625 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-03 23:31:05,625 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:31:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:31:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:31:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:31:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:31:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:31:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-03 23:31:05,626 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-03 23:31:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:31:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:31:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-03 23:31:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-03 23:31:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-03 23:31:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 23:31:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-03 23:31:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-03 23:31:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-03 23:31:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-03 23:31:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-03 23:31:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-03 23:31:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-03 23:31:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-03 23:31:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-03 23:31:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-03 23:31:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-03 23:31:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:31:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:31:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:31:05,855 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-03 23:31:06,082 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:31:06,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:31:06 BoogieIcfgContainer [2018-02-03 23:31:06,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:31:06,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:31:06,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:31:06,084 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:31:06,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:31:05" (1/3) ... [2018-02-03 23:31:06,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198395cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:31:06, skipping insertion in model container [2018-02-03 23:31:06,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:05" (2/3) ... [2018-02-03 23:31:06,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198395cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:31:06, skipping insertion in model container [2018-02-03 23:31:06,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:31:06" (3/3) ... [2018-02-03 23:31:06,086 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0236_true-valid-memsafety.i [2018-02-03 23:31:06,091 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:31:06,096 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2018-02-03 23:31:06,117 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:31:06,117 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:31:06,117 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:31:06,117 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:31:06,118 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:31:06,118 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:31:06,118 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:31:06,118 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:31:06,118 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:31:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states. [2018-02-03 23:31:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:31:06,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:06,137 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:31:06,137 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:06,140 INFO L82 PathProgramCache]: Analyzing trace with hash 12769440, now seen corresponding path program 1 times [2018-02-03 23:31:06,142 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:06,142 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:06,170 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:06,170 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:06,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:06,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:31:06,227 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-03 23:31:06,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:31:06,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:31:06,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:31:06,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:31:06,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:31:06,321 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 3 states. [2018-02-03 23:31:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:06,513 INFO L93 Difference]: Finished difference Result 282 states and 301 transitions. [2018-02-03 23:31:06,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:31:06,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:31:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:06,522 INFO L225 Difference]: With dead ends: 282 [2018-02-03 23:31:06,522 INFO L226 Difference]: Without dead ends: 279 [2018-02-03 23:31:06,523 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-03 23:31:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-03 23:31:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 248. [2018-02-03 23:31:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-03 23:31:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 263 transitions. [2018-02-03 23:31:06,556 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 263 transitions. Word has length 4 [2018-02-03 23:31:06,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:06,556 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 263 transitions. [2018-02-03 23:31:06,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:31:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 263 transitions. [2018-02-03 23:31:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:31:06,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:06,557 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:31:06,557 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash 12769441, now seen corresponding path program 1 times [2018-02-03 23:31:06,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:06,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:06,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:06,558 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:06,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:06,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:31:06,593 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-03 23:31:06,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:31:06,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:31:06,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:31:06,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:31:06,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:31:06,596 INFO L87 Difference]: Start difference. First operand 248 states and 263 transitions. Second operand 3 states. [2018-02-03 23:31:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:06,709 INFO L93 Difference]: Finished difference Result 255 states and 273 transitions. [2018-02-03 23:31:06,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:31:06,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:31:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:06,710 INFO L225 Difference]: With dead ends: 255 [2018-02-03 23:31:06,710 INFO L226 Difference]: Without dead ends: 255 [2018-02-03 23:31:06,711 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-03 23:31:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-03 23:31:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 247. [2018-02-03 23:31:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-03 23:31:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 262 transitions. [2018-02-03 23:31:06,719 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 262 transitions. Word has length 4 [2018-02-03 23:31:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:06,719 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 262 transitions. [2018-02-03 23:31:06,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:31:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 262 transitions. [2018-02-03 23:31:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:31:06,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:06,720 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:31:06,720 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1129613849, now seen corresponding path program 1 times [2018-02-03 23:31:06,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:06,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:06,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:06,721 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:06,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:06,735 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:06,735 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:06,735 INFO L213 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 (exit command is (exit), workingDir is null) [2018-02-03 23:31:06,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:06,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:06,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-03 23:31:06,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:06,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:31:06,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:31:06,801 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-03 23:31:06,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:31:06,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:31:06,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:31:06,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:31:06,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:31:06,819 INFO L87 Difference]: Start difference. First operand 247 states and 262 transitions. Second operand 4 states. [2018-02-03 23:31:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:06,974 INFO L93 Difference]: Finished difference Result 246 states and 261 transitions. [2018-02-03 23:31:06,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:31:06,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:31:06,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:06,976 INFO L225 Difference]: With dead ends: 246 [2018-02-03 23:31:06,976 INFO L226 Difference]: Without dead ends: 246 [2018-02-03 23:31:06,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-03 23:31:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-03 23:31:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-02-03 23:31:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-03 23:31:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 261 transitions. [2018-02-03 23:31:06,987 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 261 transitions. Word has length 17 [2018-02-03 23:31:06,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:06,987 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 261 transitions. [2018-02-03 23:31:06,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:31:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 261 transitions. [2018-02-03 23:31:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:31:06,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:06,988 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:31:06,988 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:06,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1129613850, now seen corresponding path program 1 times [2018-02-03 23:31:06,988 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:06,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:06,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:06,989 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:06,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:07,001 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:07,001 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:07,001 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:07,009 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:07,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:07,051 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 24 treesize of output 23 [2018-02-03 23:31:07,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:07,070 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 21 treesize of output 20 [2018-02-03 23:31:07,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:07,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:31:07,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-03 23:31:07,110 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-03 23:31:07,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:31:07,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:31:07,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:31:07,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:31:07,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:31:07,127 INFO L87 Difference]: Start difference. First operand 246 states and 261 transitions. Second operand 4 states. [2018-02-03 23:31:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:07,288 INFO L93 Difference]: Finished difference Result 245 states and 260 transitions. [2018-02-03 23:31:07,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:31:07,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:31:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:07,290 INFO L225 Difference]: With dead ends: 245 [2018-02-03 23:31:07,290 INFO L226 Difference]: Without dead ends: 245 [2018-02-03 23:31:07,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-03 23:31:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-03 23:31:07,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-02-03 23:31:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-03 23:31:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions. [2018-02-03 23:31:07,299 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 17 [2018-02-03 23:31:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:07,299 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions. [2018-02-03 23:31:07,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:31:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions. [2018-02-03 23:31:07,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-03 23:31:07,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:07,303 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-03 23:31:07,303 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1939151952, now seen corresponding path program 1 times [2018-02-03 23:31:07,304 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:07,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:07,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:07,305 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:07,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:07,321 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:07,321 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:07,322 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:07,330 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:07,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:07,427 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-03 23:31:07,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:07,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:31:07,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:31:07,482 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1)))) is different from true [2018-02-03 23:31:07,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:31:07,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-03 23:31:07,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:07,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:31:07,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-03 23:31:07,497 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~0.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~0.base_BEFORE_CALL_1))) (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1))))) is different from true [2018-02-03 23:31:07,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:31:07,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:31:07,514 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-03 23:31:07,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:07,521 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-03 23:31:07,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-03 23:31:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-02-03 23:31:07,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:31:07,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-03 23:31:07,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:31:07,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:31:07,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-03 23:31:07,592 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 15 states. [2018-02-03 23:31:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:08,223 INFO L93 Difference]: Finished difference Result 270 states and 290 transitions. [2018-02-03 23:31:08,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:31:08,223 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-03 23:31:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:08,225 INFO L225 Difference]: With dead ends: 270 [2018-02-03 23:31:08,226 INFO L226 Difference]: Without dead ends: 270 [2018-02-03 23:31:08,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-02-03 23:31:08,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-03 23:31:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 241. [2018-02-03 23:31:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-03 23:31:08,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 256 transitions. [2018-02-03 23:31:08,235 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 256 transitions. Word has length 142 [2018-02-03 23:31:08,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:08,235 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 256 transitions. [2018-02-03 23:31:08,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:31:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 256 transitions. [2018-02-03 23:31:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-03 23:31:08,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:08,237 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-03 23:31:08,237 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:08,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1939151953, now seen corresponding path program 1 times [2018-02-03 23:31:08,238 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:08,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:08,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:08,239 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:08,239 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:08,251 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:08,252 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:08,252 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:08,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:08,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-03 23:31:08,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:31:08,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:31:08,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:31:08,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:31:08,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:31:08,498 INFO L87 Difference]: Start difference. First operand 241 states and 256 transitions. Second operand 8 states. [2018-02-03 23:31:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:08,634 INFO L93 Difference]: Finished difference Result 251 states and 266 transitions. [2018-02-03 23:31:08,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:31:08,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-03 23:31:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:08,638 INFO L225 Difference]: With dead ends: 251 [2018-02-03 23:31:08,638 INFO L226 Difference]: Without dead ends: 242 [2018-02-03 23:31:08,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:31:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-03 23:31:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-02-03 23:31:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-03 23:31:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-02-03 23:31:08,651 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 142 [2018-02-03 23:31:08,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:08,651 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-02-03 23:31:08,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:31:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-02-03 23:31:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-03 23:31:08,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:08,653 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-03 23:31:08,653 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash -870251245, now seen corresponding path program 1 times [2018-02-03 23:31:08,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:08,654 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:08,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:08,657 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:08,657 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:08,679 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:08,679 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:08,679 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:08,689 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:08,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-03 23:31:09,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:31:09,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-03 23:31:09,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:31:09,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:31:09,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:31:09,017 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 9 states. [2018-02-03 23:31:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:09,120 INFO L93 Difference]: Finished difference Result 252 states and 267 transitions. [2018-02-03 23:31:09,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:31:09,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-03 23:31:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:09,121 INFO L225 Difference]: With dead ends: 252 [2018-02-03 23:31:09,121 INFO L226 Difference]: Without dead ends: 243 [2018-02-03 23:31:09,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:31:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-03 23:31:09,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-02-03 23:31:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-03 23:31:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions. [2018-02-03 23:31:09,126 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 148 [2018-02-03 23:31:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:09,127 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions. [2018-02-03 23:31:09,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:31:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions. [2018-02-03 23:31:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-03 23:31:09,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:09,129 INFO L351 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-03 23:31:09,129 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:09,129 INFO L82 PathProgramCache]: Analyzing trace with hash 500054929, now seen corresponding path program 2 times [2018-02-03 23:31:09,129 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:09,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:09,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:09,130 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:09,130 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:09,151 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:09,151 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:09,152 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:09,159 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:31:10,243 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:31:10,243 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:31:10,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 99 proven. 56 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-02-03 23:31:10,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:31:10,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-03 23:31:10,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:31:10,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:31:10,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:31:10,375 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 10 states. [2018-02-03 23:31:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:10,508 INFO L93 Difference]: Finished difference Result 253 states and 268 transitions. [2018-02-03 23:31:10,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:31:10,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-03 23:31:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:10,510 INFO L225 Difference]: With dead ends: 253 [2018-02-03 23:31:10,511 INFO L226 Difference]: Without dead ends: 244 [2018-02-03 23:31:10,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:31:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-03 23:31:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-02-03 23:31:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-03 23:31:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 259 transitions. [2018-02-03 23:31:10,516 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 259 transitions. Word has length 154 [2018-02-03 23:31:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:10,516 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 259 transitions. [2018-02-03 23:31:10,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:31:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 259 transitions. [2018-02-03 23:31:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-03 23:31:10,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:10,518 INFO L351 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-03 23:31:10,519 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:10,519 INFO L82 PathProgramCache]: Analyzing trace with hash -801201965, now seen corresponding path program 3 times [2018-02-03 23:31:10,519 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:10,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:10,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:10,520 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:31:10,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:10,531 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:10,531 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:10,531 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:10,542 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:31:10,688 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-03 23:31:10,688 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:31:10,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-02-03 23:31:10,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:31:10,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-03 23:31:10,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 23:31:10,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 23:31:10,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:31:10,787 INFO L87 Difference]: Start difference. First operand 244 states and 259 transitions. Second operand 11 states. [2018-02-03 23:31:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:10,878 INFO L93 Difference]: Finished difference Result 254 states and 269 transitions. [2018-02-03 23:31:10,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 23:31:10,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 160 [2018-02-03 23:31:10,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:10,880 INFO L225 Difference]: With dead ends: 254 [2018-02-03 23:31:10,880 INFO L226 Difference]: Without dead ends: 245 [2018-02-03 23:31:10,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-03 23:31:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-03 23:31:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-02-03 23:31:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-03 23:31:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions. [2018-02-03 23:31:10,883 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 160 [2018-02-03 23:31:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:10,883 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions. [2018-02-03 23:31:10,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 23:31:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions. [2018-02-03 23:31:10,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-02-03 23:31:10,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:10,884 INFO L351 BasicCegarLoop]: trace histogram [24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-03 23:31:10,884 INFO L371 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:10,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2017850671, now seen corresponding path program 4 times [2018-02-03 23:31:10,885 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:10,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:10,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:10,885 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:31:10,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:10,894 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:10,894 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:10,894 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:10,913 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 23:31:14,062 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 23:31:14,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:31:14,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 448 proven. 24 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-03 23:31:14,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:31:14,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-03 23:31:14,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:31:14,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:31:14,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:31:14,179 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 12 states. [2018-02-03 23:31:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:14,303 INFO L93 Difference]: Finished difference Result 255 states and 270 transitions. [2018-02-03 23:31:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:31:14,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-02-03 23:31:14,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:14,305 INFO L225 Difference]: With dead ends: 255 [2018-02-03 23:31:14,305 INFO L226 Difference]: Without dead ends: 246 [2018-02-03 23:31:14,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:31:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-03 23:31:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-02-03 23:31:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-03 23:31:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 261 transitions. [2018-02-03 23:31:14,310 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 261 transitions. Word has length 166 [2018-02-03 23:31:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:14,310 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 261 transitions. [2018-02-03 23:31:14,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:31:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 261 transitions. [2018-02-03 23:31:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-03 23:31:14,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:14,312 INFO L351 BasicCegarLoop]: trace histogram [30, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-03 23:31:14,313 INFO L371 AbstractCegarLoop]: === Iteration 11 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash -291304301, now seen corresponding path program 5 times [2018-02-03 23:31:14,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:14,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:14,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:14,314 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:31:14,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:14,325 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:14,325 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:14,325 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:14,331 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 23:31:16,068 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-03 23:31:16,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:31:16,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 437 proven. 61 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-02-03 23:31:23,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:31:23,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-03 23:31:23,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-03 23:31:23,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-03 23:31:23,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=151, Unknown=5, NotChecked=0, Total=182 [2018-02-03 23:31:23,614 INFO L87 Difference]: Start difference. First operand 246 states and 261 transitions. Second operand 14 states. [2018-02-03 23:32:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:32:05,451 INFO L93 Difference]: Finished difference Result 260 states and 277 transitions. [2018-02-03 23:32:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 23:32:05,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 172 [2018-02-03 23:32:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:32:05,452 INFO L225 Difference]: With dead ends: 260 [2018-02-03 23:32:05,452 INFO L226 Difference]: Without dead ends: 260 [2018-02-03 23:32:05,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=39, Invalid=225, Unknown=8, NotChecked=0, Total=272 [2018-02-03 23:32:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-03 23:32:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-02-03 23:32:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-03 23:32:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 275 transitions. [2018-02-03 23:32:05,455 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 275 transitions. Word has length 172 [2018-02-03 23:32:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:32:05,455 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 275 transitions. [2018-02-03 23:32:05,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-03 23:32:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 275 transitions. [2018-02-03 23:32:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-03 23:32:05,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:32:05,457 INFO L351 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-03 23:32:05,457 INFO L371 AbstractCegarLoop]: === Iteration 12 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:32:05,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1936422383, now seen corresponding path program 6 times [2018-02-03 23:32:05,457 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:32:05,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:32:05,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:32:05,457 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:32:05,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:32:05,464 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:32:05,464 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:32:05,464 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:32:05,485 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-03 23:32:15,693 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-03 23:32:15,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:32:15,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:32:15,745 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 30 treesize of output 29 [2018-02-03 23:32:15,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:16,049 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 27 treesize of output 26 [2018-02-03 23:32:16,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:16,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:32:16,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:56 [2018-02-03 23:32:18,143 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int)) (let ((.cse0 (mod (* v_prenex_4 v_prenex_6) 4294967296))) (and (= (+ (select |c_#length| v_prenex_5) 4294967296) .cse0) (< 2147483647 .cse0)))) (exists ((|v_calloc_model_#in~nmemb_BEFORE_CALL_6| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_2 Int) (v_calloc_model_~size_BEFORE_CALL_7 Int)) (let ((.cse1 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_6| v_calloc_model_~size_BEFORE_CALL_7) 4294967296))) (and (<= .cse1 2147483647) (= (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_2) .cse1))))) is different from true [2018-02-03 23:32:20,329 WARN L143 SmtUtils]: Spent 2174ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-03 23:32:24,389 WARN L143 SmtUtils]: Spent 4013ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-03 23:32:25,001 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 23 treesize of output 18 [2018-02-03 23:32:25,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:25,019 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 18 treesize of output 17 [2018-02-03 23:32:25,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:25,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-03 23:32:25,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:25,051 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 24 treesize of output 19 [2018-02-03 23:32:25,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:25,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-03 23:32:25,065 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-03 23:32:25,108 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_7| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse0 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_7| calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296) .cse0) (< 2147483647 .cse0)))) (exists ((v_prenex_16 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse1 (mod (* v_prenex_14 v_prenex_13) 4294967296))) (and (= (select |c_#length| v_prenex_16) .cse1) (<= .cse1 2147483647))))) is different from true [2018-02-03 23:32:25,128 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_7| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse7 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_7| calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296) .cse7) (< 2147483647 .cse7))))) (.cse2 (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (< 2147483647 .cse6) (= 0 (select |c_old(#valid)| v_prenex_18)) (= |c_#length| (store |c_old(#length)| v_prenex_18 (+ .cse6 (- 4294967296)))))))) (.cse3 (exists ((v_prenex_16 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse5 (mod (* v_prenex_14 v_prenex_13) 4294967296))) (and (= (select |c_#length| v_prenex_16) .cse5) (<= .cse5 2147483647))))) (.cse1 (exists ((v_prenex_20 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_20) 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse4) |c_#length|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse4 2147483647)))))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) is different from true [2018-02-03 23:32:25,142 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_7| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse0 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_7| calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296) .cse0) (< 2147483647 .cse0)))) (exists ((v_prenex_20 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse1 (mod (* |c_calloc_model_#in~nmemb| v_prenex_20) 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse1) |c_#length|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse1 2147483647))))) (and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int)) (let ((.cse2 (mod (* v_prenex_27 v_prenex_28) 4294967296))) (and (= (select |c_#length| v_prenex_26) .cse2) (<= .cse2 2147483647)))) (exists ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse3 (mod (* |c_calloc_model_#in~nmemb| v_prenex_29) 4294967296))) (and (<= .cse3 2147483647) (= (store |c_old(#length)| v_prenex_30 .cse3) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_30)))))) (and (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (< 2147483647 .cse4) (= 0 (select |c_old(#valid)| v_prenex_18)) (= |c_#length| (store |c_old(#length)| v_prenex_18 (+ .cse4 (- 4294967296))))))) (exists ((v_prenex_16 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse5 (mod (* v_prenex_14 v_prenex_13) 4294967296))) (and (= (select |c_#length| v_prenex_16) .cse5) (<= .cse5 2147483647))))) (and (exists ((v_prenex_25 Int) (v_prenex_21 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_25) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_21)) (< 2147483647 .cse6) (= (store |c_old(#length)| v_prenex_21 (+ .cse6 (- 4294967296))) |c_#length|)))) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int)) (let ((.cse7 (mod (* v_prenex_24 v_prenex_22) 4294967296))) (and (= (+ (select |c_#length| v_prenex_23) 4294967296) .cse7) (< 2147483647 .cse7)))))) is different from true [2018-02-03 23:32:25,156 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_7| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse0 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_7| calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296) .cse0) (< 2147483647 .cse0)))) (exists ((calloc_model_~ptr~0.base Int) (v_prenex_20 Int)) (let ((.cse1 (mod v_prenex_20 4294967296))) (and (<= .cse1 2147483647) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse1) |c_#length|))))) (and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int)) (let ((.cse2 (mod (* v_prenex_24 v_prenex_22) 4294967296))) (and (= (+ (select |c_#length| v_prenex_23) 4294967296) .cse2) (< 2147483647 .cse2)))) (exists ((v_prenex_25 Int) (v_prenex_21 Int)) (let ((.cse3 (mod v_prenex_25 4294967296))) (and (< 2147483647 .cse3) (= (select |c_old(#valid)| v_prenex_21) 0) (= |c_#length| (store |c_old(#length)| v_prenex_21 (+ .cse3 (- 4294967296)))))))) (and (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (let ((.cse4 (mod v_prenex_19 4294967296))) (and (< 2147483647 .cse4) (= 0 (select |c_old(#valid)| v_prenex_18)) (= |c_#length| (store |c_old(#length)| v_prenex_18 (+ .cse4 (- 4294967296))))))) (exists ((v_prenex_16 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse5 (mod (* v_prenex_14 v_prenex_13) 4294967296))) (and (= (select |c_#length| v_prenex_16) .cse5) (<= .cse5 2147483647))))) (and (exists ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse6 (mod v_prenex_29 4294967296))) (and (<= .cse6 2147483647) (= |c_#length| (store |c_old(#length)| v_prenex_30 .cse6)) (= (select |c_old(#valid)| v_prenex_30) 0)))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int)) (let ((.cse7 (mod (* v_prenex_27 v_prenex_28) 4294967296))) (and (= (select |c_#length| v_prenex_26) .cse7) (<= .cse7 2147483647)))))) is different from true [2018-02-03 23:32:25,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 65 [2018-02-03 23:32:25,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:25,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,348 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 51 treesize of output 45 [2018-02-03 23:32:25,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:25,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2018-02-03 23:32:25,484 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:25,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,609 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 47 treesize of output 41 [2018-02-03 23:32:25,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:25,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-02-03 23:32:25,778 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:25,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 63 [2018-02-03 23:32:25,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:25,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:25,964 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 49 treesize of output 43 [2018-02-03 23:32:25,965 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:26,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:26,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:26,078 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 49 treesize of output 43 [2018-02-03 23:32:26,079 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:26,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-02-03 23:32:26,182 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:201, output treesize:165 [2018-02-03 23:32:43,324 WARN L146 SmtUtils]: Spent 17062ms on a formula simplification. DAG size of input: 95 DAG size of output 64 [2018-02-03 23:32:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 522 proven. 10 refuted. 0 times theorem prover too weak. 524 trivial. 60 not checked. [2018-02-03 23:32:43,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:32:43,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-03 23:32:43,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 23:32:43,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 23:32:43,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=381, Unknown=5, NotChecked=210, Total=650 [2018-02-03 23:32:43,425 INFO L87 Difference]: Start difference. First operand 258 states and 275 transitions. Second operand 26 states. [2018-02-03 23:32:43,757 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-02-03 23:33:04,233 WARN L146 SmtUtils]: Spent 20349ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-02-03 23:33:11,356 WARN L146 SmtUtils]: Spent 3058ms on a formula simplification. DAG size of input: 53 DAG size of output 31 [2018-02-03 23:33:18,196 WARN L146 SmtUtils]: Spent 6797ms on a formula simplification. DAG size of input: 59 DAG size of output 37 [2018-02-03 23:33:22,553 WARN L146 SmtUtils]: Spent 4230ms on a formula simplification. DAG size of input: 67 DAG size of output 42 [2018-02-03 23:33:24,954 WARN L1011 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (* c_calloc_model_~nmemb c_calloc_model_~size) 4294967296))) (let ((.cse0 (= 0 c_calloc_model_~ptr~0.offset)) (.cse2 (select |c_#length| c_calloc_model_~ptr~0.base)) (.cse10 (<= .cse8 2147483647)) (.cse6 (= |c_calloc_model_#in~nmemb| c_calloc_model_~nmemb)) (.cse7 (= c_calloc_model_~size |c_calloc_model_#in~size|)) (.cse9 (< 2147483647 .cse8)) (.cse1 (mod (* |c_calloc_model_#in~nmemb| |c_calloc_model_#in~size|) 4294967296))) (and .cse0 (= .cse1 .cse2) (let ((.cse3 (= 0 (select |c_old(#valid)| |c_calloc_model_#t~malloc0.base|)))) (or (and .cse3 (exists ((calloc_model_~size Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse4) (= (store |c_old(#length)| |c_calloc_model_#t~malloc0.base| (+ .cse4 (- 4294967296))) |c_#length|))))) (and .cse3 (exists ((v_prenex_13 Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| v_prenex_13) 4294967296))) (and (<= .cse5 2147483647) (= |c_#length| (store |c_old(#length)| |c_calloc_model_#t~malloc0.base| .cse5)))))))) (or (and .cse0 .cse6 .cse7 (= .cse8 (+ .cse2 4294967296)) .cse9) (and .cse0 .cse6 .cse7 .cse10 (= .cse8 .cse2))) (let ((.cse11 (= 0 (select |c_old(#valid)| c_calloc_model_~ptr~0.base)))) (or (and .cse11 (exists ((calloc_model_~size Int)) (let ((.cse12 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse12) (= (store |c_old(#length)| c_calloc_model_~ptr~0.base (+ .cse12 (- 4294967296))) |c_#length|))))) (and .cse11 (exists ((v_prenex_13 Int)) (let ((.cse13 (mod (* |c_calloc_model_#in~nmemb| v_prenex_13) 4294967296))) (and (= (store |c_old(#length)| c_calloc_model_~ptr~0.base .cse13) |c_#length|) (<= .cse13 2147483647))))))) (= 1 (select |c_#valid| c_calloc_model_~ptr~0.base)) (let ((.cse14 (exists ((calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_7| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse21 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_7| calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296) .cse21) (< 2147483647 .cse21))))) (.cse16 (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (let ((.cse20 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (< 2147483647 .cse20) (= 0 (select |c_old(#valid)| v_prenex_18)) (= |c_#length| (store |c_old(#length)| v_prenex_18 (+ .cse20 (- 4294967296)))))))) (.cse17 (exists ((v_prenex_16 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse19 (mod (* v_prenex_14 v_prenex_13) 4294967296))) (and (= (select |c_#length| v_prenex_16) .cse19) (<= .cse19 2147483647))))) (.cse15 (exists ((v_prenex_20 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse18 (mod (* |c_calloc_model_#in~nmemb| v_prenex_20) 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse18) |c_#length|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse18 2147483647)))))) (or (and .cse14 .cse15) (and .cse16 .cse17) (and .cse14 .cse16) (and .cse17 .cse15))) (let ((.cse23 (= 0 |c_calloc_model_#t~malloc0.offset|)) (.cse22 (select |c_#length| |c_calloc_model_#t~malloc0.base|))) (or (and .cse6 (= .cse22 .cse8) .cse7 .cse23 .cse10) (and .cse6 .cse7 .cse23 (= (+ .cse22 4294967296) .cse8) .cse9))) (<= 1 .cse1) (<= .cse1 2147483647)))) is different from false [2018-02-03 23:33:31,753 WARN L146 SmtUtils]: Spent 291ms on a formula simplification. DAG size of input: 116 DAG size of output 47 [2018-02-03 23:33:34,175 WARN L146 SmtUtils]: Spent 2102ms on a formula simplification. DAG size of input: 119 DAG size of output 52 [2018-02-03 23:33:37,463 WARN L146 SmtUtils]: Spent 3122ms on a formula simplification. DAG size of input: 69 DAG size of output 35 [2018-02-03 23:33:38,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:33:38,598 INFO L93 Difference]: Finished difference Result 283 states and 305 transitions. [2018-02-03 23:33:38,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 23:33:38,598 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 178 [2018-02-03 23:33:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:33:38,599 INFO L225 Difference]: With dead ends: 283 [2018-02-03 23:33:38,599 INFO L226 Difference]: Without dead ends: 283 [2018-02-03 23:33:38,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 79.3s TimeCoverageRelationStatistics Valid=123, Invalid=1013, Unknown=10, NotChecked=414, Total=1560 [2018-02-03 23:33:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-03 23:33:38,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 254. [2018-02-03 23:33:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-03 23:33:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 271 transitions. [2018-02-03 23:33:38,604 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 271 transitions. Word has length 178 [2018-02-03 23:33:38,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:33:38,605 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 271 transitions. [2018-02-03 23:33:38,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 23:33:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 271 transitions. [2018-02-03 23:33:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-02-03 23:33:38,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:33:38,606 INFO L351 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-03 23:33:38,606 INFO L371 AbstractCegarLoop]: === Iteration 13 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:33:38,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2041705560, now seen corresponding path program 1 times [2018-02-03 23:33:38,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:33:38,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:33:38,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:33:38,607 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:33:38,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:33:38,615 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:33:38,615 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:33:38,615 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:33:38,623 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:33:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:33:38,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:33:38,718 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-03 23:33:38,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:33:38,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:33:38,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:33:38,795 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-03 23:33:38,797 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-03 23:33:38,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:33:38,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:33:38,802 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-03 23:33:38,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-03 23:33:38,814 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 21 treesize of output 17 [2018-02-03 23:33:38,815 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 17 treesize of output 5 [2018-02-03 23:33:38,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:33:38,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:33:38,818 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-03 23:33:38,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-02-03 23:33:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-02-03 23:33:38,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:33:38,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 23:33:38,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:33:38,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:33:38,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:33:38,875 INFO L87 Difference]: Start difference. First operand 254 states and 271 transitions. Second operand 12 states. [2018-02-03 23:33:39,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:33:39,307 INFO L93 Difference]: Finished difference Result 273 states and 290 transitions. [2018-02-03 23:33:39,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 23:33:39,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 181 [2018-02-03 23:33:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:33:39,308 INFO L225 Difference]: With dead ends: 273 [2018-02-03 23:33:39,308 INFO L226 Difference]: Without dead ends: 273 [2018-02-03 23:33:39,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:33:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-03 23:33:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 253. [2018-02-03 23:33:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-03 23:33:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 270 transitions. [2018-02-03 23:33:39,312 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 270 transitions. Word has length 181 [2018-02-03 23:33:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:33:39,312 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 270 transitions. [2018-02-03 23:33:39,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:33:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 270 transitions. [2018-02-03 23:33:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-02-03 23:33:39,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:33:39,313 INFO L351 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-03 23:33:39,313 INFO L371 AbstractCegarLoop]: === Iteration 14 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:33:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2041705561, now seen corresponding path program 1 times [2018-02-03 23:33:39,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:33:39,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:33:39,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:33:39,314 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:33:39,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:33:39,320 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:33:39,320 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:33:39,320 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:33:39,325 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:33:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:33:39,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:33:39,393 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 21 treesize of output 20 [2018-02-03 23:33:39,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:33:39,414 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 24 treesize of output 23 [2018-02-03 23:33:39,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:33:39,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:33:39,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-03 23:33:40,266 WARN L143 SmtUtils]: Spent 807ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-03 23:33:43,198 WARN L143 SmtUtils]: Spent 2906ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:33:45,772 WARN L143 SmtUtils]: Spent 2563ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:33:48,229 WARN L143 SmtUtils]: Spent 2427ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:33:48,916 WARN L143 SmtUtils]: Spent 672ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:33:52,945 WARN L143 SmtUtils]: Spent 4013ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:33:54,978 WARN L143 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:33:59,016 WARN L143 SmtUtils]: Spent 4015ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:33:59,211 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-03 23:33:59,213 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-03 23:33:59,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:33:59,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:33:59,224 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-03 23:33:59,226 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-03 23:33:59,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:33:59,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:33:59,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:33:59,236 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:39 [2018-02-03 23:33:59,303 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 25 treesize of output 21 [2018-02-03 23:33:59,306 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 21 treesize of output 9 [2018-02-03 23:33:59,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:33:59,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:33:59,323 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 19 treesize of output 15 [2018-02-03 23:33:59,325 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-03 23:33:59,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:33:59,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:33:59,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:33:59,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:57, output treesize:27 [2018-02-03 23:33:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 325 proven. 6 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2018-02-03 23:33:59,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:33:59,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-03 23:33:59,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-03 23:33:59,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-03 23:33:59,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-02-03 23:33:59,432 INFO L87 Difference]: Start difference. First operand 253 states and 270 transitions. Second operand 20 states. [2018-02-03 23:34:03,679 WARN L146 SmtUtils]: Spent 3987ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-02-03 23:34:04,003 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-02-03 23:34:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:34:05,570 INFO L93 Difference]: Finished difference Result 262 states and 279 transitions. [2018-02-03 23:34:05,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-03 23:34:05,570 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 181 [2018-02-03 23:34:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:34:05,571 INFO L225 Difference]: With dead ends: 262 [2018-02-03 23:34:05,571 INFO L226 Difference]: Without dead ends: 262 [2018-02-03 23:34:05,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-02-03 23:34:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-03 23:34:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-02-03 23:34:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-03 23:34:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 278 transitions. [2018-02-03 23:34:05,576 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 278 transitions. Word has length 181 [2018-02-03 23:34:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:34:05,577 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 278 transitions. [2018-02-03 23:34:05,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-03 23:34:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 278 transitions. [2018-02-03 23:34:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-03 23:34:05,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:34:05,577 INFO L351 BasicCegarLoop]: trace histogram [35, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-02-03 23:34:05,578 INFO L371 AbstractCegarLoop]: === Iteration 15 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:34:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash 823778871, now seen corresponding path program 2 times [2018-02-03 23:34:05,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:34:05,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:34:05,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:34:05,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:34:05,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:34:05,586 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:34:05,586 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:34:05,586 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:34:05,598 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:34:05,675 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:34:05,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:34:05,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:34:05,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 21 treesize of output 20 [2018-02-03 23:34:05,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:05,700 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 24 treesize of output 23 [2018-02-03 23:34:05,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:05,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:34:05,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-03 23:34:06,334 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_calloc_model_~ptr~0.base_BEFORE_CALL_6 Int) (v_calloc_model_~nmemb_BEFORE_CALL_8 Int) (v_calloc_model_~size_BEFORE_CALL_9 Int)) (let ((.cse0 (mod (* v_calloc_model_~nmemb_BEFORE_CALL_8 v_calloc_model_~size_BEFORE_CALL_9) 4294967296))) (and (= .cse0 (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_6)) (<= .cse0 2147483647)))) (exists ((v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (let ((.cse1 (mod (* v_prenex_63 v_prenex_64) 4294967296))) (and (= .cse1 (+ (select |c_#length| v_prenex_62) 4294967296)) (< 2147483647 .cse1))))) is different from true [2018-02-03 23:34:08,806 WARN L143 SmtUtils]: Spent 2463ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:34:12,837 WARN L143 SmtUtils]: Spent 4020ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:34:15,488 WARN L143 SmtUtils]: Spent 2636ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:34:17,513 WARN L143 SmtUtils]: Spent 2012ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:34:19,556 WARN L143 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:34:21,583 WARN L143 SmtUtils]: Spent 2015ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-03 23:34:23,643 WARN L146 SmtUtils]: Spent 2023ms on a formula simplification. DAG size of input: 82 DAG size of output 19 [2018-02-03 23:34:23,756 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-03 23:34:23,758 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-03 23:34:23,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:23,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:34:23,767 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-03 23:34:23,769 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-03 23:34:23,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:23,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:34:23,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:34:23,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:39 [2018-02-03 23:34:23,807 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 25 treesize of output 21 [2018-02-03 23:34:23,809 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 21 treesize of output 9 [2018-02-03 23:34:23,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:23,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:34:23,821 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 19 treesize of output 15 [2018-02-03 23:34:23,823 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-03 23:34:23,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:23,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:34:23,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:34:23,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:57, output treesize:27 [2018-02-03 23:34:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 285 proven. 5 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2018-02-03 23:34:23,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:34:23,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-03 23:34:23,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-03 23:34:23,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-03 23:34:23,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=264, Unknown=1, NotChecked=32, Total=342 [2018-02-03 23:34:23,903 INFO L87 Difference]: Start difference. First operand 261 states and 278 transitions. Second operand 19 states. [2018-02-03 23:34:26,116 WARN L146 SmtUtils]: Spent 2073ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-02-03 23:34:26,461 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-02-03 23:34:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:34:27,263 INFO L93 Difference]: Finished difference Result 260 states and 277 transitions. [2018-02-03 23:34:27,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-03 23:34:27,263 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 180 [2018-02-03 23:34:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:34:27,264 INFO L225 Difference]: With dead ends: 260 [2018-02-03 23:34:27,264 INFO L226 Difference]: Without dead ends: 260 [2018-02-03 23:34:27,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=83, Invalid=520, Unknown=1, NotChecked=46, Total=650 [2018-02-03 23:34:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-03 23:34:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2018-02-03 23:34:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-03 23:34:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 269 transitions. [2018-02-03 23:34:27,268 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 269 transitions. Word has length 180 [2018-02-03 23:34:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:34:27,268 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 269 transitions. [2018-02-03 23:34:27,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-03 23:34:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 269 transitions. [2018-02-03 23:34:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-03 23:34:27,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:34:27,269 INFO L351 BasicCegarLoop]: trace histogram [35, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1] [2018-02-03 23:34:27,269 INFO L371 AbstractCegarLoop]: === Iteration 16 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:34:27,269 INFO L82 PathProgramCache]: Analyzing trace with hash -246578790, now seen corresponding path program 1 times [2018-02-03 23:34:27,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:34:27,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:34:27,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:34:27,270 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:34:27,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:34:27,277 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:34:27,277 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:34:27,278 INFO L213 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:34:27,292 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:34:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:34:27,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:34:27,376 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 30 treesize of output 29 [2018-02-03 23:34:27,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:27,394 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 29 treesize of output 28 [2018-02-03 23:34:27,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:27,396 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 27 treesize of output 26 [2018-02-03 23:34:27,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:27,411 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 26 treesize of output 25 [2018-02-03 23:34:27,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:27,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:34:27,424 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-02-03 23:34:27,960 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= (store |c_old(#length)| |calloc_model_#t~malloc0.base| (+ (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296) (- 4294967296))) |c_#length|) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296)))) (exists ((v_prenex_85 Int) (v_prenex_87 Int) (v_prenex_86 Int)) (let ((.cse0 (mod (* v_prenex_87 v_prenex_85) 4294967296))) (and (<= .cse0 2147483647) (= 0 (select |c_old(#valid)| v_prenex_86)) (= |c_#length| (store |c_old(#length)| v_prenex_86 .cse0)))))) is different from true [2018-02-03 23:34:27,963 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 25 treesize of output 20 [2018-02-03 23:34:27,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:27,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-03 23:34:27,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:28,001 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 23 treesize of output 18 [2018-02-03 23:34:28,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:28,016 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 18 treesize of output 17 [2018-02-03 23:34:28,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:28,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-03 23:34:28,030 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-03 23:34:32,051 WARN L143 SmtUtils]: Spent 4009ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-03 23:34:36,382 WARN L146 SmtUtils]: Spent 4264ms on a formula simplification. DAG size of input: 62 DAG size of output 35 [2018-02-03 23:34:36,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:34:36,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:34:36,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 71 [2018-02-03 23:34:36,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:36,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:34:36,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 57 [2018-02-03 23:34:36,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:36,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:34:36,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:34:36,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-02-03 23:34:36,601 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:36,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:34:36,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:34:36,659 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 53 treesize of output 47 [2018-02-03 23:34:36,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:36,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-03 23:34:36,710 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:111, output treesize:93 [2018-02-03 23:34:40,881 WARN L143 SmtUtils]: Spent 4043ms on a formula simplification that was a NOOP. DAG size: 55 [2018-02-03 23:34:41,024 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (* c_calloc_model_~nmemb c_calloc_model_~size) 4294967296))) (or (and (<= .cse0 2147483647) (exists ((|calloc_model_#t~malloc0.base| Int)) (= |c_#length| (store |c_old(#length)| |calloc_model_#t~malloc0.base| (mod (* c_calloc_model_~size c_calloc_model_~nmemb) 4294967296))))) (and (exists ((v_prenex_100 Int)) (= (store |c_old(#length)| v_prenex_100 (+ (mod (* c_calloc_model_~size c_calloc_model_~nmemb) 4294967296) (- 4294967296))) |c_#length|)) (< 2147483647 .cse0)))) is different from true [2018-02-03 23:34:41,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-03 23:34:41,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:41,049 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 18 treesize of output 17 [2018-02-03 23:34:41,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:34:41,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-03 23:34:41,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:39, output treesize:37 [2018-02-03 23:34:42,119 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_103 Int) (v_prenex_101 Int) (|calloc_model_#t~malloc0.base| Int)) (and (= (select |c_#length| |calloc_model_#t~malloc0.base|) (mod (* v_prenex_103 v_prenex_101) 4294967296)) (<= (mod (* v_prenex_101 v_prenex_103) 4294967296) 2147483647))) (exists ((v_calloc_model_~nmemb_BEFORE_CALL_10 Int) (v_prenex_100 Int) (v_calloc_model_~size_BEFORE_CALL_11 Int)) (and (= (mod (* v_calloc_model_~size_BEFORE_CALL_11 v_calloc_model_~nmemb_BEFORE_CALL_10) 4294967296) (+ (select |c_#length| v_prenex_100) 4294967296)) (< 2147483647 (mod (* v_calloc_model_~nmemb_BEFORE_CALL_10 v_calloc_model_~size_BEFORE_CALL_11) 4294967296))))) is different from true [2018-02-03 23:34:44,773 WARN L143 SmtUtils]: Spent 2618ms on a formula simplification that was a NOOP. DAG size: 34 Received shutdown request... [2018-02-03 23:34:46,841 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-03 23:34:46,841 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 23:34:46,845 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 23:34:46,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:34:46 BoogieIcfgContainer [2018-02-03 23:34:46,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:34:46,845 INFO L168 Benchmark]: Toolchain (without parser) took 221463.99 ms. Allocated memory was 395.3 MB in the beginning and 663.2 MB in the end (delta: 267.9 MB). Free memory was 352.0 MB in the beginning and 603.9 MB in the end (delta: -251.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-02-03 23:34:46,846 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 395.3 MB. Free memory is still 358.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:34:46,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.41 ms. Allocated memory is still 395.3 MB. Free memory was 352.0 MB in the beginning and 338.7 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-03 23:34:46,846 INFO L168 Benchmark]: Boogie Preprocessor took 31.90 ms. Allocated memory is still 395.3 MB. Free memory was 338.7 MB in the beginning and 337.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 23:34:46,846 INFO L168 Benchmark]: RCFGBuilder took 491.45 ms. Allocated memory is still 395.3 MB. Free memory was 337.3 MB in the beginning and 280.3 MB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 5.3 GB. [2018-02-03 23:34:46,846 INFO L168 Benchmark]: TraceAbstraction took 220762.16 ms. Allocated memory was 395.3 MB in the beginning and 663.2 MB in the end (delta: 267.9 MB). Free memory was 280.3 MB in the beginning and 603.9 MB in the end (delta: -323.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:34:46,847 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 395.3 MB. Free memory is still 358.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 175.41 ms. Allocated memory is still 395.3 MB. Free memory was 352.0 MB in the beginning and 338.7 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.90 ms. Allocated memory is still 395.3 MB. Free memory was 338.7 MB in the beginning and 337.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 491.45 ms. Allocated memory is still 395.3 MB. Free memory was 337.3 MB in the beginning and 280.3 MB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 220762.16 ms. Allocated memory was 395.3 MB in the beginning and 663.2 MB in the end (delta: 267.9 MB). Free memory was 280.3 MB in the beginning and 603.9 MB in the end (delta: -323.6 MB). There was no memory consumed. 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 839). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 840). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 840). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 841). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 841). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 823). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 823). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 823). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 823). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 824). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 824). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 830). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 831). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 831). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 830). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 876]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 876). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 814). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 814). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 871). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 869). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 869). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 871). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 784). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 784). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 878). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 878). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 861). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 861). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 850). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 851). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 851). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 850). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 253 locations, 85 error locations. TIMEOUT Result, 220.7s OverallTime, 16 OverallIterations, 36 TraceHistogramMax, 108.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3438 SDtfs, 1042 SDslu, 21009 SDs, 0 SdLazy, 8703 SolverSat, 186 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 41.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1891 GetRequests, 1686 SyntacticMatches, 5 SemanticMatches, 200 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 138.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=14, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 128 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 16.7s SatisfiabilityAnalysisTime, 74.3s InterpolantComputationTime, 1846 NumberOfCodeBlocks, 1564 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1831 ConstructedInterpolants, 113 QuantifiedInterpolants, 1302639 SizeOfPredicates, 95 NumberOfNonLiveVariables, 7718 ConjunctsInSsa, 403 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 7560/7798 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/test-0236_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-34-46-852.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0236_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-34-46-852.csv Completed graceful shutdown