java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:43:31,959 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:43:31,961 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:43:31,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:43:31,974 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:43:31,975 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:43:31,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:43:31,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:43:31,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:43:31,980 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:43:31,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:43:31,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:43:31,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:43:31,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:43:31,983 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:43:31,985 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:43:31,987 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:43:31,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:43:31,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:43:31,992 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:43:31,994 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:43:31,994 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:43:31,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:43:31,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:43:31,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:43:31,997 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:43:31,998 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:43:31,998 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:43:31,998 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:43:31,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:43:31,999 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:43:32,000 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:43:32,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:43:32,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:43:32,010 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:43:32,010 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:43:32,010 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:43:32,011 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:43:32,011 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:43:32,011 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:43:32,011 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:43:32,012 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:43:32,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:43:32,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:43:32,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:43:32,012 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:43:32,013 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:43:32,013 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:43:32,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:43:32,013 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:43:32,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:43:32,014 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:43:32,014 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:43:32,014 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:43:32,014 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:43:32,014 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:43:32,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:43:32,015 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:43:32,015 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:43:32,015 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:43:32,015 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:43:32,015 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:43:32,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:43:32,016 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:43:32,016 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:43:32,017 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:43:32,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:43:32,062 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:43:32,066 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:43:32,068 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:43:32,068 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:43:32,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i [2018-01-28 21:43:32,260 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:43:32,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:43:32,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:43:32,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:43:32,271 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:43:32,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:43:32" (1/1) ... [2018-01-28 21:43:32,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be68e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:32, skipping insertion in model container [2018-01-28 21:43:32,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:43:32" (1/1) ... [2018-01-28 21:43:32,291 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:43:32,336 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:43:32,457 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:43:32,480 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:43:32,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:32 WrapperNode [2018-01-28 21:43:32,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:43:32,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:43:32,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:43:32,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:43:32,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:32" (1/1) ... [2018-01-28 21:43:32,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:32" (1/1) ... [2018-01-28 21:43:32,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:32" (1/1) ... [2018-01-28 21:43:32,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:32" (1/1) ... [2018-01-28 21:43:32,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:32" (1/1) ... [2018-01-28 21:43:32,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:32" (1/1) ... [2018-01-28 21:43:32,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:32" (1/1) ... [2018-01-28 21:43:32,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:43:32,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:43:32,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:43:32,535 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:43:32,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:32" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:43:32,577 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:43:32,577 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:43:32,577 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-01-28 21:43:32,577 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-01-28 21:43:32,577 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-01-28 21:43:32,577 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-01-28 21:43:32,577 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-01-28 21:43:32,577 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-01-28 21:43:32,578 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-01-28 21:43:32,578 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-01-28 21:43:32,578 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-01-28 21:43:32,578 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-01-28 21:43:32,578 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-01-28 21:43:32,578 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-01-28 21:43:32,578 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:43:32,579 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 21:43:32,579 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 21:43:32,579 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:43:32,579 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:43:32,579 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:43:32,579 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-28 21:43:32,579 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-28 21:43:32,580 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 21:43:32,580 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 21:43:32,580 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-28 21:43:32,580 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-28 21:43:32,580 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-01-28 21:43:32,580 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:43:32,581 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-01-28 21:43:32,581 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-01-28 21:43:32,581 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-01-28 21:43:32,581 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-01-28 21:43:32,581 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-01-28 21:43:32,582 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-01-28 21:43:32,582 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-01-28 21:43:32,582 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-01-28 21:43:32,582 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-01-28 21:43:32,582 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-01-28 21:43:32,582 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-01-28 21:43:32,582 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:43:32,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:43:32,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:43:32,906 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-28 21:43:33,254 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:43:33,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:43:33 BoogieIcfgContainer [2018-01-28 21:43:33,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:43:33,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:43:33,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:43:33,258 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:43:33,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:43:32" (1/3) ... [2018-01-28 21:43:33,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0f21a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:43:33, skipping insertion in model container [2018-01-28 21:43:33,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:32" (2/3) ... [2018-01-28 21:43:33,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0f21a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:43:33, skipping insertion in model container [2018-01-28 21:43:33,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:43:33" (3/3) ... [2018-01-28 21:43:33,261 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0237_true-valid-memsafety.i [2018-01-28 21:43:33,267 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:43:33,273 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations. [2018-01-28 21:43:33,326 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:43:33,326 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:43:33,326 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:43:33,326 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:43:33,327 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:43:33,327 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:43:33,327 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:43:33,327 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:43:33,327 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:43:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states. [2018-01-28 21:43:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-28 21:43:33,354 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:43:33,355 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-28 21:43:33,355 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-28 21:43:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 422481090, now seen corresponding path program 1 times [2018-01-28 21:43:33,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:43:33,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:43:33,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:33,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:33,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:43:33,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:43:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:43:33,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:43:33,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:43:33,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:43:33,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:43:33,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:43:33,585 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 3 states. [2018-01-28 21:43:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:43:33,910 INFO L93 Difference]: Finished difference Result 582 states and 664 transitions. [2018-01-28 21:43:33,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:43:33,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-28 21:43:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:43:33,928 INFO L225 Difference]: With dead ends: 582 [2018-01-28 21:43:33,928 INFO L226 Difference]: Without dead ends: 306 [2018-01-28 21:43:33,935 INFO L533 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-01-28 21:43:33,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-01-28 21:43:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 275. [2018-01-28 21:43:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-01-28 21:43:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 290 transitions. [2018-01-28 21:43:33,998 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 290 transitions. Word has length 5 [2018-01-28 21:43:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:43:33,999 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 290 transitions. [2018-01-28 21:43:33,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:43:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 290 transitions. [2018-01-28 21:43:33,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-28 21:43:34,000 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:43:34,000 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-28 21:43:34,000 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-28 21:43:34,000 INFO L82 PathProgramCache]: Analyzing trace with hash 422481091, now seen corresponding path program 1 times [2018-01-28 21:43:34,000 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:43:34,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:43:34,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:34,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:34,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:43:34,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:43:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:43:34,062 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:43:34,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:43:34,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:43:34,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:43:34,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:43:34,065 INFO L87 Difference]: Start difference. First operand 275 states and 290 transitions. Second operand 3 states. [2018-01-28 21:43:34,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:43:34,235 INFO L93 Difference]: Finished difference Result 284 states and 302 transitions. [2018-01-28 21:43:34,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:43:34,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-28 21:43:34,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:43:34,237 INFO L225 Difference]: With dead ends: 284 [2018-01-28 21:43:34,237 INFO L226 Difference]: Without dead ends: 283 [2018-01-28 21:43:34,238 INFO L533 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-01-28 21:43:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-01-28 21:43:34,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 274. [2018-01-28 21:43:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-01-28 21:43:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 289 transitions. [2018-01-28 21:43:34,259 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 289 transitions. Word has length 5 [2018-01-28 21:43:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:43:34,260 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 289 transitions. [2018-01-28 21:43:34,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:43:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 289 transitions. [2018-01-28 21:43:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:43:34,261 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:43:34,261 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:43:34,261 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-28 21:43:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1662349820, now seen corresponding path program 1 times [2018-01-28 21:43:34,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:43:34,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:43:34,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:34,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:34,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:34,285 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:43:34,285 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:43:34,285 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 21:43:34,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:43:34,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:43:34,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:43:34,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:34,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:43:34,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:43:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:43:34,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:43:34,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:43:34,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:43:34,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:43:34,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:43:34,393 INFO L87 Difference]: Start difference. First operand 274 states and 289 transitions. Second operand 4 states. [2018-01-28 21:43:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:43:34,634 INFO L93 Difference]: Finished difference Result 274 states and 289 transitions. [2018-01-28 21:43:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:43:34,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 21:43:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:43:34,636 INFO L225 Difference]: With dead ends: 274 [2018-01-28 21:43:34,636 INFO L226 Difference]: Without dead ends: 273 [2018-01-28 21:43:34,637 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:43:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-28 21:43:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-01-28 21:43:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-01-28 21:43:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 288 transitions. [2018-01-28 21:43:34,653 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 288 transitions. Word has length 19 [2018-01-28 21:43:34,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:43:34,653 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 288 transitions. [2018-01-28 21:43:34,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:43:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 288 transitions. [2018-01-28 21:43:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:43:34,654 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:43:34,654 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:43:34,654 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-28 21:43:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1662349819, now seen corresponding path program 1 times [2018-01-28 21:43:34,654 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:43:34,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:43:34,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:34,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:34,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:34,668 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:43:34,669 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:43:34,669 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 21:43:34,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:43:34,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:43:34,704 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-01-28 21:43:34,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:34,722 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-01-28 21:43:34,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:34,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:43:34,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-01-28 21:43:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:43:34,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:43:34,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:43:34,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:43:34,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:43:34,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:43:34,802 INFO L87 Difference]: Start difference. First operand 273 states and 288 transitions. Second operand 4 states. [2018-01-28 21:43:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:43:35,089 INFO L93 Difference]: Finished difference Result 273 states and 288 transitions. [2018-01-28 21:43:35,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:43:35,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 21:43:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:43:35,091 INFO L225 Difference]: With dead ends: 273 [2018-01-28 21:43:35,091 INFO L226 Difference]: Without dead ends: 272 [2018-01-28 21:43:35,092 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:43:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-01-28 21:43:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2018-01-28 21:43:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-28 21:43:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 287 transitions. [2018-01-28 21:43:35,106 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 287 transitions. Word has length 19 [2018-01-28 21:43:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:43:35,106 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 287 transitions. [2018-01-28 21:43:35,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:43:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 287 transitions. [2018-01-28 21:43:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-01-28 21:43:35,111 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:43:35,111 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:43:35,111 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-28 21:43:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash 625482073, now seen corresponding path program 1 times [2018-01-28 21:43:35,112 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:43:35,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:43:35,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:35,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:35,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:35,138 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:43:35,139 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:43:35,139 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 21:43:35,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:43:35,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:43:35,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:43:35,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:35,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:43:35,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:43:35,375 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-01-28 21:43:35,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:35,383 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-01-28 21:43:35,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:35,385 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-01-28 21:43:35,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-28 21:43:35,396 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~5.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-01-28 21:43:35,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:35,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:35,420 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-01-28 21:43:35,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:35,432 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-01-28 21:43:35,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-01-28 21:43:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 12 not checked. [2018-01-28 21:43:35,568 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:43:35,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-01-28 21:43:35,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 21:43:35,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 21:43:35,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-01-28 21:43:35,608 INFO L87 Difference]: Start difference. First operand 272 states and 287 transitions. Second operand 15 states. [2018-01-28 21:43:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:43:36,501 INFO L93 Difference]: Finished difference Result 301 states and 321 transitions. [2018-01-28 21:43:36,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 21:43:36,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 180 [2018-01-28 21:43:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:43:36,507 INFO L225 Difference]: With dead ends: 301 [2018-01-28 21:43:36,507 INFO L226 Difference]: Without dead ends: 297 [2018-01-28 21:43:36,508 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=383, Unknown=2, NotChecked=82, Total=552 [2018-01-28 21:43:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-01-28 21:43:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 268. [2018-01-28 21:43:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-01-28 21:43:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 283 transitions. [2018-01-28 21:43:36,527 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 283 transitions. Word has length 180 [2018-01-28 21:43:36,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:43:36,528 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 283 transitions. [2018-01-28 21:43:36,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 21:43:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 283 transitions. [2018-01-28 21:43:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-01-28 21:43:36,531 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:43:36,531 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:43:36,531 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-28 21:43:36,532 INFO L82 PathProgramCache]: Analyzing trace with hash 625482074, now seen corresponding path program 1 times [2018-01-28 21:43:36,532 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:43:36,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:43:36,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:36,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:36,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:36,552 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:43:36,552 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:43:36,552 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 21:43:36,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:43:36,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:43:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-01-28 21:43:36,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:43:36,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:43:36,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:43:36,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:43:36,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:43:36,895 INFO L87 Difference]: Start difference. First operand 268 states and 283 transitions. Second operand 9 states. [2018-01-28 21:43:37,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:43:37,064 INFO L93 Difference]: Finished difference Result 543 states and 584 transitions. [2018-01-28 21:43:37,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:43:37,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2018-01-28 21:43:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:43:37,067 INFO L225 Difference]: With dead ends: 543 [2018-01-28 21:43:37,067 INFO L226 Difference]: Without dead ends: 271 [2018-01-28 21:43:37,069 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:43:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-28 21:43:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-01-28 21:43:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-01-28 21:43:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 284 transitions. [2018-01-28 21:43:37,088 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 284 transitions. Word has length 180 [2018-01-28 21:43:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:43:37,088 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 284 transitions. [2018-01-28 21:43:37,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:43:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 284 transitions. [2018-01-28 21:43:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-01-28 21:43:37,091 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:43:37,092 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:43:37,092 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-28 21:43:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1208457038, now seen corresponding path program 1 times [2018-01-28 21:43:37,092 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:43:37,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:43:37,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:37,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:37,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:37,114 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:43:37,114 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:43:37,114 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:43:37,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:43:37,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:43:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 140 proven. 1 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2018-01-28 21:43:37,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:43:37,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-01-28 21:43:37,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:43:37,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:43:37,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:43:37,506 INFO L87 Difference]: Start difference. First operand 269 states and 284 transitions. Second operand 11 states. [2018-01-28 21:43:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:43:37,650 INFO L93 Difference]: Finished difference Result 547 states and 588 transitions. [2018-01-28 21:43:37,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:43:37,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 198 [2018-01-28 21:43:37,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:43:37,653 INFO L225 Difference]: With dead ends: 547 [2018-01-28 21:43:37,653 INFO L226 Difference]: Without dead ends: 274 [2018-01-28 21:43:37,655 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:43:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-28 21:43:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2018-01-28 21:43:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-01-28 21:43:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 287 transitions. [2018-01-28 21:43:37,674 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 287 transitions. Word has length 198 [2018-01-28 21:43:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:43:37,674 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 287 transitions. [2018-01-28 21:43:37,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:43:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 287 transitions. [2018-01-28 21:43:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-01-28 21:43:37,677 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:43:37,678 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:43:37,678 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-28 21:43:37,678 INFO L82 PathProgramCache]: Analyzing trace with hash 278587418, now seen corresponding path program 2 times [2018-01-28 21:43:37,678 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:43:37,678 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:43:37,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:37,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:43:37,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:37,698 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:43:37,698 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:43:37,698 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:43:37,712 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:43:37,750 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:43:37,799 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:43:40,102 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:43:40,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:43:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 132 proven. 175 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-01-28 21:43:40,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:43:40,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-01-28 21:43:40,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 21:43:40,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 21:43:40,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:43:40,288 INFO L87 Difference]: Start difference. First operand 272 states and 287 transitions. Second operand 13 states. [2018-01-28 21:43:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:43:40,479 INFO L93 Difference]: Finished difference Result 553 states and 594 transitions. [2018-01-28 21:43:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 21:43:40,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 216 [2018-01-28 21:43:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:43:40,485 INFO L225 Difference]: With dead ends: 553 [2018-01-28 21:43:40,485 INFO L226 Difference]: Without dead ends: 277 [2018-01-28 21:43:40,486 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-01-28 21:43:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-01-28 21:43:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-01-28 21:43:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-01-28 21:43:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 290 transitions. [2018-01-28 21:43:40,504 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 290 transitions. Word has length 216 [2018-01-28 21:43:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:43:40,504 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 290 transitions. [2018-01-28 21:43:40,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 21:43:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 290 transitions. [2018-01-28 21:43:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-01-28 21:43:40,508 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:43:40,508 INFO L330 BasicCegarLoop]: trace histogram [18, 18, 18, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:43:40,508 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-28 21:43:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash 349743630, now seen corresponding path program 3 times [2018-01-28 21:43:40,509 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:43:40,509 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:43:40,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:40,510 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:43:40,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:43:40,526 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:43:40,527 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:43:40,527 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:43:40,536 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:43:40,586 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:43:40,628 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:43:40,806 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:43:40,856 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:43:40,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:43:40,917 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-01-28 21:43:40,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:42,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 36 treesize of output 35 [2018-01-28 21:43:42,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:43,271 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-01-28 21:43:43,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:43,273 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-01-28 21:43:43,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:45,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:43:45,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-01-28 21:43:45,486 WARN L143 SmtUtils]: Spent 321ms on a formula simplification that was a NOOP. DAG size: 28 [2018-01-28 21:43:52,398 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-01-28 21:43:52,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:52,420 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-01-28 21:43:52,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:52,442 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-01-28 21:43:52,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:52,463 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-01-28 21:43:52,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:52,484 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-01-28 21:43:52,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-01-28 21:43:54,492 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_26 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (let ((.cse0 (mod (* v_prenex_26 v_prenex_24) 4294967296))) (and (= .cse0 (select |c_#length| v_prenex_25)) (<= .cse0 2147483647)))) (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int)) (let ((.cse1 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse1) (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296) .cse1))))) is different from true [2018-01-28 21:43:54,532 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_prenex_29 Int) (v_prenex_31 Int)) (let ((.cse7 (mod (* |c_calloc_model_#in~nmemb| v_prenex_31) 4294967296))) (and (<= .cse7 2147483647) (= (select |c_old(#valid)| v_prenex_29) 0) (= |c_#length| (store |c_old(#length)| v_prenex_29 .cse7)))))) (.cse0 (exists ((v_prenex_26 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (let ((.cse6 (mod (* v_prenex_26 v_prenex_24) 4294967296))) (and (= .cse6 (select |c_#length| v_prenex_25)) (<= .cse6 2147483647))))) (.cse1 (exists ((calloc_model_~ptr~5.base Int) (v_prenex_30 Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| v_prenex_30) 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~5.base (+ .cse5 (- 4294967296))) |c_#length|) (= (select |c_old(#valid)| calloc_model_~ptr~5.base) 0) (< 2147483647 .cse5))))) (.cse3 (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int)) (let ((.cse4 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse4) (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296) .cse4)))))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse2 .cse0) (and .cse1 .cse3))) is different from true [2018-01-28 21:43:54,554 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_26 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (let ((.cse0 (mod (* v_prenex_26 v_prenex_24) 4294967296))) (and (= .cse0 (select |c_#length| v_prenex_25)) (<= .cse0 2147483647)))) (exists ((calloc_model_~ptr~5.base Int) (v_prenex_30 Int)) (let ((.cse1 (mod (* |c_calloc_model_#in~nmemb| v_prenex_30) 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~5.base (+ .cse1 (- 4294967296))) |c_#length|) (= (select |c_old(#valid)| calloc_model_~ptr~5.base) 0) (< 2147483647 .cse1))))) (and (exists ((v_prenex_29 Int) (v_prenex_31 Int)) (let ((.cse2 (mod (* |c_calloc_model_#in~nmemb| v_prenex_31) 4294967296))) (and (<= .cse2 2147483647) (= (select |c_old(#valid)| v_prenex_29) 0) (= |c_#length| (store |c_old(#length)| v_prenex_29 .cse2))))) (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int)) (let ((.cse3 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse3) (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296) .cse3))))) (and (exists ((v_prenex_33 Int) (v_prenex_36 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_36) 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_33 .cse4)) (<= .cse4 2147483647) (= (select |c_old(#valid)| v_prenex_33) 0)))) (exists ((v_prenex_34 Int) (v_prenex_35 Int) (v_prenex_32 Int)) (let ((.cse5 (mod (* v_prenex_32 v_prenex_35) 4294967296))) (and (= .cse5 (select |c_#length| v_prenex_34)) (<= .cse5 2147483647))))) (and (exists ((v_prenex_38 Int) (v_prenex_40 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_40) 4294967296))) (and (= (store |c_old(#length)| v_prenex_38 (+ .cse6 (- 4294967296))) |c_#length|) (= (select |c_old(#valid)| v_prenex_38) 0) (< 2147483647 .cse6)))) (exists ((v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_41 Int)) (let ((.cse7 (mod (* v_prenex_41 v_prenex_39) 4294967296))) (and (< 2147483647 .cse7) (= (+ (select |c_#length| v_prenex_37) 4294967296) .cse7)))))) is different from true [2018-01-28 21:43:56,294 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 96 DAG size of output 29 [2018-01-28 21:43:56,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:56,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:56,317 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 34 treesize of output 47 [2018-01-28 21:43:56,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:56,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:56,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:56,354 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 33 treesize of output 27 [2018-01-28 21:43:56,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:56,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:56,388 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 32 treesize of output 35 [2018-01-28 21:43:56,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:56,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:56,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:56,418 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 31 treesize of output 25 [2018-01-28 21:43:56,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:56,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 21:43:56,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-01-28 21:43:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 443 proven. 13 refuted. 0 times theorem prover too weak. 413 trivial. 43 not checked. [2018-01-28 21:43:56,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:43:56,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-01-28 21:43:56,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 21:43:56,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 21:43:56,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=443, Unknown=9, NotChecked=132, Total=650 [2018-01-28 21:43:56,674 INFO L87 Difference]: Start difference. First operand 275 states and 290 transitions. Second operand 26 states. [2018-01-28 21:43:57,442 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 79 DAG size of output 51 [2018-01-28 21:44:09,325 WARN L146 SmtUtils]: Spent 8051ms on a formula simplification. DAG size of input: 104 DAG size of output 76 [2018-01-28 21:44:11,760 WARN L146 SmtUtils]: Spent 2079ms on a formula simplification. DAG size of input: 68 DAG size of output 43 [2018-01-28 21:45:03,414 WARN L146 SmtUtils]: Spent 48728ms on a formula simplification. DAG size of input: 127 DAG size of output 54 [2018-01-28 21:46:04,147 WARN L146 SmtUtils]: Spent 55240ms on a formula simplification. DAG size of input: 178 DAG size of output 61 [2018-01-28 21:46:10,835 WARN L1033 $PredicateComparison]: unable to prove that (and (or (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_2 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_4| Int) (|v_calloc_model_#in~size_BEFORE_CALL_4| Int)) (let ((.cse0 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_4| |v_calloc_model_#in~size_BEFORE_CALL_4|) 4294967296))) (and (<= .cse0 2147483647) (= .cse0 (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_2)) (= 1 (select |c_#valid| v_calloc_model_~ptr~5.base_BEFORE_CALL_2))))) (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int)) (let ((.cse1 (mod (* v_prenex_4 v_prenex_5) 4294967296))) (and (= 1 (select |c_#valid| v_prenex_3)) (= (+ (select |c_#length| v_prenex_3) 4294967296) .cse1) (< 2147483647 .cse1))))) (or (exists ((v_prenex_33 Int) (v_prenex_36 Int)) (let ((.cse2 (mod v_prenex_36 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_33 .cse2)) (<= .cse2 2147483647) (= 0 (select |c_old(#valid)| v_prenex_33))))) (exists ((v_prenex_38 Int) (v_prenex_40 Int)) (let ((.cse3 (mod v_prenex_40 4294967296))) (and (= (select |c_old(#valid)| v_prenex_38) 0) (< 2147483647 .cse3) (= (store |c_old(#length)| v_prenex_38 (+ .cse3 (- 4294967296))) |c_#length|)))))) is different from true Received shutdown request... [2018-01-28 21:46:17,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 21:46:17,038 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 21:46:17,065 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 21:46:17,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:46:17 BoogieIcfgContainer [2018-01-28 21:46:17,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:46:17,066 INFO L168 Benchmark]: Toolchain (without parser) took 164806.02 ms. Allocated memory was 308.8 MB in the beginning and 605.6 MB in the end (delta: 296.7 MB). Free memory was 267.8 MB in the beginning and 419.8 MB in the end (delta: -152.0 MB). Peak memory consumption was 144.8 MB. Max. memory is 5.3 GB. [2018-01-28 21:46:17,068 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:46:17,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.33 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 254.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:46:17,069 INFO L168 Benchmark]: Boogie Preprocessor took 41.95 ms. Allocated memory is still 308.8 MB. Free memory was 254.8 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:46:17,069 INFO L168 Benchmark]: RCFGBuilder took 719.44 ms. Allocated memory is still 308.8 MB. Free memory was 252.8 MB in the beginning and 194.5 MB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 5.3 GB. [2018-01-28 21:46:17,069 INFO L168 Benchmark]: TraceAbstraction took 163809.93 ms. Allocated memory was 308.8 MB in the beginning and 605.6 MB in the end (delta: 296.7 MB). Free memory was 194.5 MB in the beginning and 419.8 MB in the end (delta: -225.3 MB). Peak memory consumption was 71.5 MB. Max. memory is 5.3 GB. [2018-01-28 21:46:17,071 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.18 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.33 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 254.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.95 ms. Allocated memory is still 308.8 MB. Free memory was 254.8 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 719.44 ms. Allocated memory is still 308.8 MB. Free memory was 252.8 MB in the beginning and 194.5 MB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 163809.93 ms. Allocated memory was 308.8 MB in the beginning and 605.6 MB in the end (delta: 296.7 MB). Free memory was 194.5 MB in the beginning and 419.8 MB in the end (delta: -225.3 MB). Peak memory consumption was 71.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 874]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 874). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (275states) and interpolant automaton (currently 25 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 281 locations, 83 error locations. TIMEOUT Result, 163.7s OverallTime, 9 OverallIterations, 18 TraceHistogramMax, 142.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2156 SDtfs, 690 SDslu, 8871 SDs, 0 SdLazy, 2722 SolverSat, 130 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1088 GetRequests, 973 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 140.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=0, 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, 8 MinimizatonAttempts, 75 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 1056 NumberOfCodeBlocks, 923 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1047 ConstructedInterpolants, 68 QuantifiedInterpolants, 1101398 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3629 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 2399/2643 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-46-17-084.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-46-17-084.csv Completed graceful shutdown