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-0235_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:06:17,947 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:06:17,949 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:06:17,961 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:06:17,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:06:17,962 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:06:17,963 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:06:17,964 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:06:17,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:06:17,966 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:06:17,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:06:17,967 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:06:17,967 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:06:17,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:06:17,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:06:17,970 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:06:17,972 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:06:17,973 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:06:17,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:06:17,975 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:06:17,976 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:06:17,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:06:17,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:06:17,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:06:17,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:06:17,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:06:17,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:06:17,979 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:06:17,979 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:06:17,980 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:06:17,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:06:17,980 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:06:17,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:06:17,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:06:17,990 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:06:17,990 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:06:17,990 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:06:17,990 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:06:17,990 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:06:17,991 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:06:17,991 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:06:17,991 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:06:17,991 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:06:17,991 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:06:17,991 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:06:17,991 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:06:17,991 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:06:17,992 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:06:17,992 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:06:17,992 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:06:17,992 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:06:17,992 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:06:17,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:06:17,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:06:17,993 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:06:17,993 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:06:17,993 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:06:18,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:06:18,033 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:06:18,036 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:06:18,038 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:06:18,038 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:06:18,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-deref.i [2018-02-03 23:06:18,183 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:06:18,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:06:18,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:06:18,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:06:18,191 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:06:18,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:06:18" (1/1) ... [2018-02-03 23:06:18,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8a56c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:06:18, skipping insertion in model container [2018-02-03 23:06:18,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:06:18" (1/1) ... [2018-02-03 23:06:18,209 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:06:18,243 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:06:18,336 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:06:18,353 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:06:18,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:06:18 WrapperNode [2018-02-03 23:06:18,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:06:18,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:06:18,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:06:18,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:06:18,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:06:18" (1/1) ... [2018-02-03 23:06:18,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:06:18" (1/1) ... [2018-02-03 23:06:18,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:06:18" (1/1) ... [2018-02-03 23:06:18,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:06:18" (1/1) ... [2018-02-03 23:06:18,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:06:18" (1/1) ... [2018-02-03 23:06:18,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:06:18" (1/1) ... [2018-02-03 23:06:18,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:06:18" (1/1) ... [2018-02-03 23:06:18,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:06:18,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:06:18,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:06:18,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:06:18,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:06:18" (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:06:18,435 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:06:18,435 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:06:18,436 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-03 23:06:18,436 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-03 23:06:18,436 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-03 23:06:18,436 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-03 23:06:18,436 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-03 23:06:18,436 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-03 23:06:18,436 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-03 23:06:18,436 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-03 23:06:18,436 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-03 23:06:18,436 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-03 23:06:18,437 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-03 23:06:18,437 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-03 23:06:18,437 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:06:18,437 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:06:18,437 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:06:18,437 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:06:18,437 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:06:18,437 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:06:18,437 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-03 23:06:18,437 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-03 23:06:18,437 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:06:18,437 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:06:18,437 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-03 23:06:18,437 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-03 23:06:18,437 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:06:18,438 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:06:18,439 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:06:18,769 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-03 23:06:18,914 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:06:18,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:06:18 BoogieIcfgContainer [2018-02-03 23:06:18,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:06:18,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:06:18,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:06:18,917 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:06:18,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:06:18" (1/3) ... [2018-02-03 23:06:18,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8a469e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:06:18, skipping insertion in model container [2018-02-03 23:06:18,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:06:18" (2/3) ... [2018-02-03 23:06:18,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8a469e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:06:18, skipping insertion in model container [2018-02-03 23:06:18,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:06:18" (3/3) ... [2018-02-03 23:06:18,919 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_false-valid-deref.i [2018-02-03 23:06:18,924 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:06:18,930 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2018-02-03 23:06:18,953 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:06:18,954 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:06:18,954 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:06:18,954 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:06:18,954 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:06:18,954 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:06:18,954 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:06:18,954 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:06:18,955 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:06:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2018-02-03 23:06:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:06:18,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:06:18,976 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:06:18,976 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:06:18,979 INFO L82 PathProgramCache]: Analyzing trace with hash 15319548, now seen corresponding path program 1 times [2018-02-03 23:06:18,980 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:06:18,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:06:19,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:19,011 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:19,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:06:19,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:06:19,084 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:06:19,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:06:19,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:06:19,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:06:19,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:06:19,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:06:19,161 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 3 states. [2018-02-03 23:06:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:06:19,399 INFO L93 Difference]: Finished difference Result 394 states and 450 transitions. [2018-02-03 23:06:19,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:06:19,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:06:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:06:19,416 INFO L225 Difference]: With dead ends: 394 [2018-02-03 23:06:19,416 INFO L226 Difference]: Without dead ends: 391 [2018-02-03 23:06:19,418 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:06:19,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-03 23:06:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 345. [2018-02-03 23:06:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-03 23:06:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 426 transitions. [2018-02-03 23:06:19,469 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 426 transitions. Word has length 4 [2018-02-03 23:06:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:06:19,470 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 426 transitions. [2018-02-03 23:06:19,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:06:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 426 transitions. [2018-02-03 23:06:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:06:19,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:06:19,471 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:06:19,471 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:06:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash 15319549, now seen corresponding path program 1 times [2018-02-03 23:06:19,471 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:06:19,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:06:19,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:19,472 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:19,472 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:06:19,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:06:19,528 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:06:19,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:06:19,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:06:19,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:06:19,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:06:19,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:06:19,530 INFO L87 Difference]: Start difference. First operand 345 states and 426 transitions. Second operand 3 states. [2018-02-03 23:06:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:06:19,641 INFO L93 Difference]: Finished difference Result 352 states and 436 transitions. [2018-02-03 23:06:19,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:06:19,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:06:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:06:19,643 INFO L225 Difference]: With dead ends: 352 [2018-02-03 23:06:19,643 INFO L226 Difference]: Without dead ends: 352 [2018-02-03 23:06:19,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:06:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-02-03 23:06:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2018-02-03 23:06:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-03 23:06:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 425 transitions. [2018-02-03 23:06:19,661 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 425 transitions. Word has length 4 [2018-02-03 23:06:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:06:19,661 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 425 transitions. [2018-02-03 23:06:19,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:06:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 425 transitions. [2018-02-03 23:06:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:06:19,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:06:19,662 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:06:19,662 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:06:19,662 INFO L82 PathProgramCache]: Analyzing trace with hash 116258063, now seen corresponding path program 1 times [2018-02-03 23:06:19,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:06:19,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:06:19,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:19,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:19,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:19,679 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:06:19,680 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:06:19,680 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:06:19,687 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:06:19,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:06:19,736 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:06:19,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:06:19,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:06:19,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:06:19,746 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:06:19,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:06:19,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:06:19,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:06:19,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:06:19,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:06:19,778 INFO L87 Difference]: Start difference. First operand 344 states and 425 transitions. Second operand 4 states. [2018-02-03 23:06:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:06:19,908 INFO L93 Difference]: Finished difference Result 343 states and 424 transitions. [2018-02-03 23:06:19,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:06:19,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:06:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:06:19,910 INFO L225 Difference]: With dead ends: 343 [2018-02-03 23:06:19,910 INFO L226 Difference]: Without dead ends: 343 [2018-02-03 23:06:19,910 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:06:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-03 23:06:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-02-03 23:06:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-03 23:06:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 424 transitions. [2018-02-03 23:06:19,919 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 424 transitions. Word has length 17 [2018-02-03 23:06:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:06:19,919 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 424 transitions. [2018-02-03 23:06:19,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:06:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 424 transitions. [2018-02-03 23:06:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:06:19,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:06:19,919 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:06:19,919 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:06:19,920 INFO L82 PathProgramCache]: Analyzing trace with hash 116258064, now seen corresponding path program 1 times [2018-02-03 23:06:19,920 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:06:19,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:06:19,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:19,920 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:19,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:19,930 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:06:19,930 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:06:19,930 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:06:19,941 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:06:19,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:06:19,968 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:06:19,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:06:19,981 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:06:19,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:06:19,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:06:19,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-03 23:06:20,024 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:06:20,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:06:20,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:06:20,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:06:20,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:06:20,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:06:20,043 INFO L87 Difference]: Start difference. First operand 343 states and 424 transitions. Second operand 4 states. [2018-02-03 23:06:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:06:20,246 INFO L93 Difference]: Finished difference Result 342 states and 423 transitions. [2018-02-03 23:06:20,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:06:20,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:06:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:06:20,247 INFO L225 Difference]: With dead ends: 342 [2018-02-03 23:06:20,248 INFO L226 Difference]: Without dead ends: 342 [2018-02-03 23:06:20,248 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:06:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-03 23:06:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2018-02-03 23:06:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-03 23:06:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 423 transitions. [2018-02-03 23:06:20,254 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 423 transitions. Word has length 17 [2018-02-03 23:06:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:06:20,254 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 423 transitions. [2018-02-03 23:06:20,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:06:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 423 transitions. [2018-02-03 23:06:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-03 23:06:20,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:06:20,258 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:06:20,258 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:06:20,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2125517946, now seen corresponding path program 1 times [2018-02-03 23:06:20,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:06:20,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:06:20,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:20,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:20,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:20,276 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:06:20,276 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:06:20,276 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:06:20,283 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:06:20,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:06:20,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 6 treesize of output 5 [2018-02-03 23:06:20,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:06:20,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:06:20,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:06:20,438 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:06:20,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:06:20,444 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:06:20,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:06:20,445 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:06:20,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-03 23:06:20,452 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:06:20,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:06:20,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:06:20,463 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:06:20,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:06:20,469 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:06:20,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-03 23:06:20,502 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:06:20,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:06:20,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-03 23:06:20,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:06:20,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:06:20,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-03 23:06:20,521 INFO L87 Difference]: Start difference. First operand 342 states and 423 transitions. Second operand 15 states. [2018-02-03 23:06:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:06:21,487 INFO L93 Difference]: Finished difference Result 518 states and 637 transitions. [2018-02-03 23:06:21,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:06:21,487 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-03 23:06:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:06:21,489 INFO L225 Difference]: With dead ends: 518 [2018-02-03 23:06:21,490 INFO L226 Difference]: Without dead ends: 518 [2018-02-03 23:06:21,490 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:06:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-02-03 23:06:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 385. [2018-02-03 23:06:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-03 23:06:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 498 transitions. [2018-02-03 23:06:21,503 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 498 transitions. Word has length 142 [2018-02-03 23:06:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:06:21,503 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 498 transitions. [2018-02-03 23:06:21,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:06:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 498 transitions. [2018-02-03 23:06:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-03 23:06:21,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:06:21,505 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:06:21,506 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:06:21,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2125517947, now seen corresponding path program 1 times [2018-02-03 23:06:21,506 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:06:21,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:06:21,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:21,507 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:21,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:21,520 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:06:21,520 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:06:21,520 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:06:21,528 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:06:21,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:06:21,703 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:06:21,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:06:21,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:06:21,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:06:21,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:06:21,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:06:21,721 INFO L87 Difference]: Start difference. First operand 385 states and 498 transitions. Second operand 8 states. [2018-02-03 23:06:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:06:21,798 INFO L93 Difference]: Finished difference Result 395 states and 508 transitions. [2018-02-03 23:06:21,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:06:21,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-03 23:06:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:06:21,802 INFO L225 Difference]: With dead ends: 395 [2018-02-03 23:06:21,802 INFO L226 Difference]: Without dead ends: 386 [2018-02-03 23:06:21,802 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:06:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-03 23:06:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2018-02-03 23:06:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-03 23:06:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 499 transitions. [2018-02-03 23:06:21,811 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 499 transitions. Word has length 142 [2018-02-03 23:06:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:06:21,811 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 499 transitions. [2018-02-03 23:06:21,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:06:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 499 transitions. [2018-02-03 23:06:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-03 23:06:21,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:06:21,813 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:06:21,813 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:06:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash 370058419, now seen corresponding path program 1 times [2018-02-03 23:06:21,813 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:06:21,813 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:06:21,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:21,814 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:21,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:21,825 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:06:21,825 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:06:21,825 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:06:21,838 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:06:22,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:06:22,149 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:06:22,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:06:22,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-03 23:06:22,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:06:22,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:06:22,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:06:22,170 INFO L87 Difference]: Start difference. First operand 386 states and 499 transitions. Second operand 9 states. [2018-02-03 23:06:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:06:22,266 INFO L93 Difference]: Finished difference Result 396 states and 509 transitions. [2018-02-03 23:06:22,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:06:22,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-03 23:06:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:06:22,268 INFO L225 Difference]: With dead ends: 396 [2018-02-03 23:06:22,268 INFO L226 Difference]: Without dead ends: 387 [2018-02-03 23:06:22,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:06:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-03 23:06:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-02-03 23:06:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-03 23:06:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 500 transitions. [2018-02-03 23:06:22,276 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 500 transitions. Word has length 148 [2018-02-03 23:06:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:06:22,276 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 500 transitions. [2018-02-03 23:06:22,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:06:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 500 transitions. [2018-02-03 23:06:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-03 23:06:22,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:06:22,278 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:06:22,278 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:06:22,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1295616315, now seen corresponding path program 2 times [2018-02-03 23:06:22,278 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:06:22,278 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:06:22,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:22,279 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:06:22,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:06:22,289 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:06:22,289 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:06:22,289 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:06:22,298 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:06:24,173 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:06:24,173 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:06:24,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:06:36,802 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 130 proven. 3 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-02-03 23:06:36,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:06:36,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-03 23:06:36,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:06:36,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:06:36,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=66, Unknown=7, NotChecked=0, Total=90 [2018-02-03 23:06:36,822 INFO L87 Difference]: Start difference. First operand 387 states and 500 transitions. Second operand 10 states. [2018-02-03 23:07:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:07:25,217 INFO L93 Difference]: Finished difference Result 403 states and 519 transitions. [2018-02-03 23:07:25,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:07:25,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-03 23:07:25,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:07:25,220 INFO L225 Difference]: With dead ends: 403 [2018-02-03 23:07:25,220 INFO L226 Difference]: Without dead ends: 403 [2018-02-03 23:07:25,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=29, Invalid=116, Unknown=11, NotChecked=0, Total=156 [2018-02-03 23:07:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-03 23:07:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-02-03 23:07:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-03 23:07:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 519 transitions. [2018-02-03 23:07:25,230 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 519 transitions. Word has length 154 [2018-02-03 23:07:25,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:07:25,231 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 519 transitions. [2018-02-03 23:07:25,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:07:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 519 transitions. [2018-02-03 23:07:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-03 23:07:25,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:07:25,233 INFO L351 BasicCegarLoop]: trace histogram [17, 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:07:25,233 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:07:25,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1790041466, now seen corresponding path program 3 times [2018-02-03 23:07:25,233 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:07:25,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:07:25,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:07:25,234 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:07:25,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:07:25,244 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:07:25,245 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:07:25,245 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:07:25,252 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:07:25,312 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-03 23:07:25,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:07:25,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:07:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-02-03 23:07:25,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:07:25,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-03 23:07:25,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:07:25,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:07:25,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:07:25,448 INFO L87 Difference]: Start difference. First operand 403 states and 519 transitions. Second operand 10 states. [2018-02-03 23:07:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:07:25,551 INFO L93 Difference]: Finished difference Result 410 states and 525 transitions. [2018-02-03 23:07:25,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:07:25,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2018-02-03 23:07:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:07:25,557 INFO L225 Difference]: With dead ends: 410 [2018-02-03 23:07:25,557 INFO L226 Difference]: Without dead ends: 401 [2018-02-03 23:07:25,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:07:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-03 23:07:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2018-02-03 23:07:25,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-02-03 23:07:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 514 transitions. [2018-02-03 23:07:25,566 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 514 transitions. Word has length 159 [2018-02-03 23:07:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:07:25,566 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 514 transitions. [2018-02-03 23:07:25,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:07:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 514 transitions. [2018-02-03 23:07:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-03 23:07:25,568 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:07:25,568 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:07:25,568 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:07:25,568 INFO L82 PathProgramCache]: Analyzing trace with hash -456422541, now seen corresponding path program 4 times [2018-02-03 23:07:25,568 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:07:25,568 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:07:25,569 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:07:25,569 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:07:25,569 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:07:25,577 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:07:25,577 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:07:25,578 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:07:25,585 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 23:07:32,520 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 23:07:32,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:07:32,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:07:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 276 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-02-03 23:07:32,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:07:32,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-03 23:07:32,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 23:07:32,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 23:07:32,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:07:32,616 INFO L87 Difference]: Start difference. First operand 401 states and 514 transitions. Second operand 11 states. [2018-02-03 23:07:32,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:07:32,723 INFO L93 Difference]: Finished difference Result 418 states and 531 transitions. [2018-02-03 23:07:32,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 23:07:32,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 160 [2018-02-03 23:07:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:07:32,725 INFO L225 Difference]: With dead ends: 418 [2018-02-03 23:07:32,725 INFO L226 Difference]: Without dead ends: 402 [2018-02-03 23:07:32,726 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-03 23:07:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-02-03 23:07:32,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2018-02-03 23:07:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-02-03 23:07:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 515 transitions. [2018-02-03 23:07:32,735 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 515 transitions. Word has length 160 [2018-02-03 23:07:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:07:32,735 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 515 transitions. [2018-02-03 23:07:32,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 23:07:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 515 transitions. [2018-02-03 23:07:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-02-03 23:07:32,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:07:32,737 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:07:32,737 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:07:32,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2005786107, now seen corresponding path program 5 times [2018-02-03 23:07:32,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:07:32,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:07:32,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:07:32,739 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:07:32,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:07:32,749 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:07:32,749 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:07:32,749 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:07:32,763 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 23:07:33,103 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-02-03 23:07:33,103 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:07:33,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:07:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 349 proven. 40 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-02-03 23:07:33,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:07:33,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-03 23:07:33,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:07:33,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:07:33,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:07:33,218 INFO L87 Difference]: Start difference. First operand 402 states and 515 transitions. Second operand 12 states. [2018-02-03 23:07:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:07:33,337 INFO L93 Difference]: Finished difference Result 419 states and 532 transitions. [2018-02-03 23:07:33,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:07:33,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-02-03 23:07:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:07:33,339 INFO L225 Difference]: With dead ends: 419 [2018-02-03 23:07:33,339 INFO L226 Difference]: Without dead ends: 403 [2018-02-03 23:07:33,339 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:07:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-03 23:07:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-02-03 23:07:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-03 23:07:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 516 transitions. [2018-02-03 23:07:33,349 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 516 transitions. Word has length 166 [2018-02-03 23:07:33,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:07:33,350 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 516 transitions. [2018-02-03 23:07:33,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:07:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 516 transitions. [2018-02-03 23:07:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-03 23:07:33,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:07:33,352 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:07:33,352 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_insertErr0RequiresViolation, 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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:07:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash -709586381, now seen corresponding path program 6 times [2018-02-03 23:07:33,352 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:07:33,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:07:33,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:07:33,353 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:07:33,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:07:33,364 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:07:33,364 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:07:33,364 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:07:33,372 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-03 23:07:34,576 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-03 23:07:34,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:07:34,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:07:34,590 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 36 treesize of output 35 [2018-02-03 23:07:34,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:34,617 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 35 treesize of output 34 [2018-02-03 23:07:34,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:34,619 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 33 treesize of output 32 [2018-02-03 23:07:34,620 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:34,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-02-03 23:07:34,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:34,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:07:34,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-03 23:07:40,127 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:07:40,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:40,147 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:07:40,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:40,169 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:07:40,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:40,186 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:07:40,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:40,201 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:07:40,201 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-03 23:07:40,244 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:07:40,259 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:07:40,272 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:07:40,289 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:07:40,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:40,316 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 51 treesize of output 54 [2018-02-03 23:07:40,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:40,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:40,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:40,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-02-03 23:07:40,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:40,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:40,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:40,678 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 53 treesize of output 66 [2018-02-03 23:07:40,678 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:40,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:40,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:40,944 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 52 treesize of output 46 [2018-02-03 23:07:40,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:41,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:41,130 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 53 treesize of output 56 [2018-02-03 23:07:41,130 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:41,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:41,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:41,312 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 55 treesize of output 68 [2018-02-03 23:07:41,313 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:41,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:41,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:41,477 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 54 treesize of output 48 [2018-02-03 23:07:41,478 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:41,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:41,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:07:41,633 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 52 treesize of output 46 [2018-02-03 23:07:41,633 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:07:41,733 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:07:41,733 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:213, output treesize:177 [2018-02-03 23:08:09,124 WARN L146 SmtUtils]: Spent 27328ms on a formula simplification. DAG size of input: 96 DAG size of output 55 [2018-02-03 23:08:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 422 proven. 9 refuted. 0 times theorem prover too weak. 407 trivial. 47 not checked. [2018-02-03 23:08:09,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:08:09,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-03 23:08:09,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-03 23:08:09,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-03 23:08:09,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=447, Unknown=6, NotChecked=180, Total=702 [2018-02-03 23:08:09,199 INFO L87 Difference]: Start difference. First operand 403 states and 516 transitions. Second operand 27 states. [2018-02-03 23:08:11,837 WARN L146 SmtUtils]: Spent 256ms on a formula simplification. DAG size of input: 80 DAG size of output 51 [2018-02-03 23:08:33,685 WARN L146 SmtUtils]: Spent 19600ms on a formula simplification. DAG size of input: 80 DAG size of output 76 [2018-02-03 23:08:34,068 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 72 DAG size of output 47 [2018-02-03 23:09:10,308 WARN L146 SmtUtils]: Spent 34864ms on a formula simplification. DAG size of input: 130 DAG size of output 54 Received shutdown request... [2018-02-03 23:10:03,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 23:10:03,013 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 23:10:03,017 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 23:10:03,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:10:03 BoogieIcfgContainer [2018-02-03 23:10:03,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:10:03,018 INFO L168 Benchmark]: Toolchain (without parser) took 224834.78 ms. Allocated memory was 404.8 MB in the beginning and 708.3 MB in the end (delta: 303.6 MB). Free memory was 361.4 MB in the beginning and 582.1 MB in the end (delta: -220.6 MB). Peak memory consumption was 82.9 MB. Max. memory is 5.3 GB. [2018-02-03 23:10:03,019 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 404.8 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:10:03,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.70 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 348.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-03 23:10:03,020 INFO L168 Benchmark]: Boogie Preprocessor took 34.55 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 345.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:10:03,020 INFO L168 Benchmark]: RCFGBuilder took 515.61 ms. Allocated memory is still 404.8 MB. Free memory was 345.6 MB in the beginning and 285.9 MB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 5.3 GB. [2018-02-03 23:10:03,020 INFO L168 Benchmark]: TraceAbstraction took 224102.75 ms. Allocated memory was 404.8 MB in the beginning and 708.3 MB in the end (delta: 303.6 MB). Free memory was 285.9 MB in the beginning and 582.1 MB in the end (delta: -296.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 5.3 GB. [2018-02-03 23:10:03,021 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.16 ms. Allocated memory is still 404.8 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 178.70 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 348.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.55 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 345.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 515.61 ms. Allocated memory is still 404.8 MB. Free memory was 345.6 MB in the beginning and 285.9 MB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 224102.75 ms. Allocated memory was 404.8 MB in the beginning and 708.3 MB in the end (delta: 303.6 MB). Free memory was 285.9 MB in the beginning and 582.1 MB in the end (delta: -296.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (403states) and interpolant automaton (currently 13 states, 27 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 182. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 275 locations, 85 error locations. TIMEOUT Result, 224.0s OverallTime, 12 OverallIterations, 30 TraceHistogramMax, 164.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3037 SDtfs, 902 SDslu, 16357 SDs, 0 SdLazy, 3240 SolverSat, 164 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 45.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1310 GetRequests, 1178 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 111.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=8, 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, 11 MinimizatonAttempts, 187 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 10.6s SatisfiabilityAnalysisTime, 48.0s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 983 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1273 ConstructedInterpolants, 57 QuantifiedInterpolants, 842193 SizeOfPredicates, 61 NumberOfNonLiveVariables, 4860 ConjunctsInSsa, 429 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 3747/3883 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-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-10-03-028.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-10-03-028.csv Completed graceful shutdown