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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:23:21,904 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:23:21,906 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:23:21,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:23:21,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:23:21,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:23:21,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:23:21,924 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:23:21,926 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:23:21,927 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:23:21,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:23:21,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:23:21,928 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:23:21,929 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:23:21,930 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:23:21,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:23:21,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:23:21,937 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:23:21,938 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:23:21,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:23:21,942 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:23:21,942 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:23:21,942 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:23:21,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:23:21,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:23:21,946 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:23:21,946 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:23:21,947 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:23:21,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:23:21,947 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:23:21,948 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:23:21,948 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:23:21,958 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:23:21,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:23:21,959 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:23:21,960 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:23:21,960 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:23:21,960 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:23:21,960 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:23:21,961 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:23:21,961 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:23:21,961 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:23:21,962 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:23:21,962 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:23:21,962 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:23:21,962 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:23:21,962 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:23:21,962 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:23:21,963 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:23:21,963 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:23:21,963 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:23:21,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:23:21,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:23:21,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:23:21,964 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:23:21,964 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:23:21,964 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:23:21,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:23:21,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:23:21,965 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:23:21,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:23:21,965 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:23:21,966 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:23:21,966 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:23:21,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:23:21,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:23:21,966 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:23:21,967 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:23:21,967 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:23:22,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:23:22,017 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:23:22,021 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:23:22,022 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:23:22,023 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:23:22,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2018-01-20 22:23:22,199 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:23:22,204 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:23:22,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:23:22,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:23:22,210 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:23:22,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:23:22" (1/1) ... [2018-01-20 22:23:22,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22bbba22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:22, skipping insertion in model container [2018-01-20 22:23:22,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:23:22" (1/1) ... [2018-01-20 22:23:22,229 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:23:22,267 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:23:22,389 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:23:22,406 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:23:22,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:22 WrapperNode [2018-01-20 22:23:22,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:23:22,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:23:22,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:23:22,417 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:23:22,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:22" (1/1) ... [2018-01-20 22:23:22,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:22" (1/1) ... [2018-01-20 22:23:22,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:22" (1/1) ... [2018-01-20 22:23:22,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:22" (1/1) ... [2018-01-20 22:23:22,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:22" (1/1) ... [2018-01-20 22:23:22,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:22" (1/1) ... [2018-01-20 22:23:22,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:22" (1/1) ... [2018-01-20 22:23:22,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:23:22,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:23:22,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:23:22,467 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:23:22,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:22" (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-20 22:23:22,530 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:23:22,530 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:23:22,530 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-20 22:23:22,530 INFO L136 BoogieDeclarations]: Found implementation of procedure remove [2018-01-20 22:23:22,530 INFO L136 BoogieDeclarations]: Found implementation of procedure re_insert [2018-01-20 22:23:22,531 INFO L136 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-01-20 22:23:22,531 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:23:22,531 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:23:22,531 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:23:22,531 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:23:22,531 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:23:22,532 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:23:22,532 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-20 22:23:22,532 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-01-20 22:23:22,532 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:23:22,532 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-20 22:23:22,532 INFO L128 BoogieDeclarations]: Found specification of procedure remove [2018-01-20 22:23:22,532 INFO L128 BoogieDeclarations]: Found specification of procedure re_insert [2018-01-20 22:23:22,533 INFO L128 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-01-20 22:23:22,533 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:23:22,533 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:23:22,533 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:23:22,886 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:23:22,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:22 BoogieIcfgContainer [2018-01-20 22:23:22,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:23:22,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:23:22,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:23:22,889 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:23:22,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:23:22" (1/3) ... [2018-01-20 22:23:22,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a2fcd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:23:22, skipping insertion in model container [2018-01-20 22:23:22,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:23:22" (2/3) ... [2018-01-20 22:23:22,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a2fcd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:23:22, skipping insertion in model container [2018-01-20 22:23:22,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:22" (3/3) ... [2018-01-20 22:23:22,892 INFO L105 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-01-20 22:23:22,899 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:23:22,905 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-20 22:23:22,950 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:23:22,950 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:23:22,950 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:23:22,950 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:23:22,950 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:23:22,951 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:23:22,951 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:23:22,951 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:23:22,952 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:23:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-20 22:23:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:23:22,979 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:22,980 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:23:22,981 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:23:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash 178905, now seen corresponding path program 1 times [2018-01-20 22:23:22,988 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:22,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:23,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:23,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:23:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:23:23,112 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:23:23,120 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:23:23,129 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:23:23,129 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:23:23,130 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:23:23,130 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:23:23,130 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:23:23,130 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:23:23,130 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:23:23,130 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == re_insertErr0EnsuresViolation======== [2018-01-20 22:23:23,130 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:23:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-20 22:23:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 22:23:23,137 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:23,137 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:23:23,137 INFO L371 AbstractCegarLoop]: === Iteration 1 === [re_insertErr0EnsuresViolation]=== [2018-01-20 22:23:23,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1611447727, now seen corresponding path program 1 times [2018-01-20 22:23:23,138 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:23,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:23,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:23,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:23,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:23:23,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:23:23,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:23:23,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:23:23,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:23:23,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:23:23,329 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 2 states. [2018-01-20 22:23:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:23,361 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2018-01-20 22:23:23,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:23:23,363 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 39 [2018-01-20 22:23:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:23,371 INFO L225 Difference]: With dead ends: 149 [2018-01-20 22:23:23,371 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:23:23,375 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:23:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:23:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:23:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:23:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:23:23,401 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-01-20 22:23:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:23,401 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:23:23,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:23:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:23:23,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:23:23,404 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:23:23,405 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:23:23,405 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:23:23,405 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:23:23,405 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:23:23,405 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:23:23,405 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:23:23,405 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:23:23,406 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:23:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-20 22:23:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-20 22:23:23,412 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:23,412 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:23:23,412 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:23:23,412 INFO L82 PathProgramCache]: Analyzing trace with hash -715233718, now seen corresponding path program 1 times [2018-01-20 22:23:23,412 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:23,413 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:23,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:23,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:23,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:23:23,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:23:23,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:23:23,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:23:23,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:23:23,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:23:23,469 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 2 states. [2018-01-20 22:23:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:23,481 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2018-01-20 22:23:23,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:23:23,482 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 56 [2018-01-20 22:23:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:23,486 INFO L225 Difference]: With dead ends: 149 [2018-01-20 22:23:23,486 INFO L226 Difference]: Without dead ends: 78 [2018-01-20 22:23:23,488 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:23:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-20 22:23:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-20 22:23:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-20 22:23:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-01-20 22:23:23,512 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 56 [2018-01-20 22:23:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:23,512 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-01-20 22:23:23,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:23:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-01-20 22:23:23,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-20 22:23:23,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:23,515 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:23:23,515 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:23:23,516 INFO L82 PathProgramCache]: Analyzing trace with hash 675519653, now seen corresponding path program 1 times [2018-01-20 22:23:23,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:23,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:23,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:23,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:23:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:23:23,599 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:23:23,608 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:23:23,610 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:23:23,612 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:23:23,613 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:23:23,614 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:23:23,615 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:23:23,615 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:23:23,616 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:23:23,616 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:23:23,627 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:23:23,627 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:23:23,628 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:23:23,628 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:23:23,628 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:23:23,628 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:23:23,628 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:23:23,628 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:23:23,628 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:23:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-20 22:23:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-20 22:23:23,633 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:23,633 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:23:23,633 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:23:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1572438346, now seen corresponding path program 1 times [2018-01-20 22:23:23,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:23,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:23,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:23,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:23,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:23:23,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:23:23,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:23:23,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:23:23,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:23:23,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:23:23,669 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 2 states. [2018-01-20 22:23:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:23,677 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2018-01-20 22:23:23,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:23:23,678 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 54 [2018-01-20 22:23:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:23,679 INFO L225 Difference]: With dead ends: 149 [2018-01-20 22:23:23,679 INFO L226 Difference]: Without dead ends: 76 [2018-01-20 22:23:23,680 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:23:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-20 22:23:23,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-20 22:23:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-20 22:23:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-01-20 22:23:23,687 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 54 [2018-01-20 22:23:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:23,687 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-01-20 22:23:23,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:23:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-01-20 22:23:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-20 22:23:23,688 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:23,689 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:23:23,689 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:23:23,689 INFO L82 PathProgramCache]: Analyzing trace with hash 362713701, now seen corresponding path program 1 times [2018-01-20 22:23:23,689 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:23,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:23,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:23,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:23,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:23:23,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:23:23,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:23:23,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:23:23,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:23:23,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:23:23,857 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 4 states. [2018-01-20 22:23:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:24,162 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2018-01-20 22:23:24,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:23:24,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-01-20 22:23:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:24,164 INFO L225 Difference]: With dead ends: 96 [2018-01-20 22:23:24,164 INFO L226 Difference]: Without dead ends: 79 [2018-01-20 22:23:24,165 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-20 22:23:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-20 22:23:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-01-20 22:23:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-20 22:23:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-01-20 22:23:24,174 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 55 [2018-01-20 22:23:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:24,174 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-01-20 22:23:24,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:23:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-01-20 22:23:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 22:23:24,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:24,176 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:23:24,176 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:23:24,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2096216182, now seen corresponding path program 1 times [2018-01-20 22:23:24,176 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:24,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:24,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:24,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:24,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:24,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:23:24,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:23:24,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:23:24,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:23:24,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:23:24,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:23:24,247 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 4 states. [2018-01-20 22:23:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:24,278 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2018-01-20 22:23:24,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:23:24,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-01-20 22:23:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:24,280 INFO L225 Difference]: With dead ends: 138 [2018-01-20 22:23:24,280 INFO L226 Difference]: Without dead ends: 80 [2018-01-20 22:23:24,281 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-20 22:23:24,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-20 22:23:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-01-20 22:23:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-20 22:23:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2018-01-20 22:23:24,291 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 58 [2018-01-20 22:23:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:24,291 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2018-01-20 22:23:24,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:23:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2018-01-20 22:23:24,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-20 22:23:24,293 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:24,293 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:23:24,293 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:23:24,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1351865632, now seen corresponding path program 1 times [2018-01-20 22:23:24,293 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:24,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:24,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:24,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:24,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:24,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-20 22:23:24,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:23:24,436 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:23:24,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:24,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:23:24,545 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-20 22:23:24,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:23:24,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:23:24,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:23:24,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:23:24,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:23:24,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:23:24,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:23:24,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:23:24,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-20 22:23:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 22:23:24,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:23:24,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-01-20 22:23:24,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:23:24,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:23:24,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:23:24,648 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 9 states. [2018-01-20 22:23:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:23:24,996 INFO L93 Difference]: Finished difference Result 163 states and 200 transitions. [2018-01-20 22:23:25,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 22:23:25,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-01-20 22:23:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:23:25,051 INFO L225 Difference]: With dead ends: 163 [2018-01-20 22:23:25,052 INFO L226 Difference]: Without dead ends: 106 [2018-01-20 22:23:25,052 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-01-20 22:23:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-20 22:23:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2018-01-20 22:23:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-20 22:23:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2018-01-20 22:23:25,066 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 64 [2018-01-20 22:23:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:23:25,066 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2018-01-20 22:23:25,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:23:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2018-01-20 22:23:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-20 22:23:25,067 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:23:25,067 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:23:25,067 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:23:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash 998777250, now seen corresponding path program 1 times [2018-01-20 22:23:25,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:23:25,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:23:25,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:25,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:25,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:23:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:25,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:23:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-20 22:23:25,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:23:25,497 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:23:25,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:23:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:23:25,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:23:25,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:23:25,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:23:25,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:23:25,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:23:25,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:23:25,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-01-20 22:23:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:23:25,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:23:25,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-20 22:23:25,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-20 22:23:25,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-20 22:23:25,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-01-20 22:23:25,799 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand 21 states. [2018-01-20 22:24:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:24:05,431 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2018-01-20 22:24:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-20 22:24:05,431 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-01-20 22:24:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:24:05,433 INFO L225 Difference]: With dead ends: 231 [2018-01-20 22:24:05,433 INFO L226 Difference]: Without dead ends: 189 [2018-01-20 22:24:05,434 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2018-01-20 22:24:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-20 22:24:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 157. [2018-01-20 22:24:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-20 22:24:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 197 transitions. [2018-01-20 22:24:05,457 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 197 transitions. Word has length 64 [2018-01-20 22:24:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:24:05,457 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 197 transitions. [2018-01-20 22:24:05,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-20 22:24:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 197 transitions. [2018-01-20 22:24:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-20 22:24:05,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:24:05,460 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:24:05,460 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 22:24:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 970429150, now seen corresponding path program 1 times [2018-01-20 22:24:05,460 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:24:05,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:24:05,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:05,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:24:05,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:24:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:24:05,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:24:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-20 22:24:06,310 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:24:06,310 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:24:06,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:24:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:24:06,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:24:06,347 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-20 22:24:06,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:06,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:06,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:24:06,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:24:06,384 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:24:06,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:24:06,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:06,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:06,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-20 22:24:06,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:24:06,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-01-20 22:24:06,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:06,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:06,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:06,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-20 22:24:07,519 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|remove_#t~mem4.base| Int) (|remove_#t~mem2.offset| Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_remove_#in~x.base|) (+ |c_remove_#in~x.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) |remove_#t~mem2.offset| |remove_#t~mem4.base|))))) is different from true [2018-01-20 22:24:07,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-20 22:24:07,531 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 14 treesize of output 13 [2018-01-20 22:24:07,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:24:07,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:21 [2018-01-20 22:24:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:24:09,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:24:09,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 34 [2018-01-20 22:24:09,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-20 22:24:09,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-20 22:24:09,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=959, Unknown=1, NotChecked=62, Total=1122 [2018-01-20 22:24:09,928 INFO L87 Difference]: Start difference. First operand 157 states and 197 transitions. Second operand 34 states. Received shutdown request... [2018-01-20 22:24:39,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 22:24:39,105 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:24:39,108 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:24:39,108 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:24:39,108 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:24:39,108 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:24:39,108 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:24:39,108 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:24:39,108 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:24:39,108 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == is_list_containing_xErr0EnsuresViolation======== [2018-01-20 22:24:39,108 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:24:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-20 22:24:39,109 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:24:39,110 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:24:39,110 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:24:39,110 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:24:39,110 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:24:39,110 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:24:39,110 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:24:39,110 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:24:39,110 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == __VERIFIER_assertErr0EnsuresViolation======== [2018-01-20 22:24:39,110 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:24:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-20 22:24:39,111 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:24:39,112 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:24:39,112 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:24:39,112 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:24:39,112 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:24:39,112 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:24:39,112 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:24:39,112 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:24:39,112 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == removeErr0EnsuresViolation======== [2018-01-20 22:24:39,112 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:24:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-01-20 22:24:39,113 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:24:39,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:24:39 BoogieIcfgContainer [2018-01-20 22:24:39,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:24:39,114 INFO L168 Benchmark]: Toolchain (without parser) took 76914.37 ms. Allocated memory was 305.7 MB in the beginning and 541.1 MB in the end (delta: 235.4 MB). Free memory was 263.6 MB in the beginning and 318.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 180.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:24:39,115 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 305.7 MB. Free memory was 271.5 MB in the beginning and 269.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:24:39,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.65 ms. Allocated memory is still 305.7 MB. Free memory was 262.6 MB in the beginning and 251.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:24:39,116 INFO L168 Benchmark]: Boogie Preprocessor took 49.48 ms. Allocated memory is still 305.7 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:24:39,116 INFO L168 Benchmark]: RCFGBuilder took 420.41 ms. Allocated memory is still 305.7 MB. Free memory was 249.5 MB in the beginning and 225.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:24:39,116 INFO L168 Benchmark]: TraceAbstraction took 76226.35 ms. Allocated memory was 305.7 MB in the beginning and 541.1 MB in the end (delta: 235.4 MB). Free memory was 224.5 MB in the beginning and 318.4 MB in the end (delta: -93.9 MB). Peak memory consumption was 141.5 MB. Max. memory is 5.3 GB. [2018-01-20 22:24:39,118 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.21 ms. Allocated memory is still 305.7 MB. Free memory was 271.5 MB in the beginning and 269.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.65 ms. Allocated memory is still 305.7 MB. Free memory was 262.6 MB in the beginning and 251.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 49.48 ms. Allocated memory is still 305.7 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 420.41 ms. Allocated memory is still 305.7 MB. Free memory was 249.5 MB in the beginning and 225.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 76226.35 ms. Allocated memory was 305.7 MB in the beginning and 541.1 MB in the end (delta: 235.4 MB). Free memory was 224.5 MB in the beginning and 318.4 MB in the end (delta: -93.9 MB). Peak memory consumption was 141.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 572]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: re_insertErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 95 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 1444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L589] FCALL struct node list; VAL [list={10:0}] [L590] FCALL list.L=0 VAL [list={10:0}] [L591] FCALL list.R=0 VAL [list={10:0}] [L592] struct node *x=&list, *tail=&list; VAL [list={10:0}, tail={10:0}, x={10:0}] [L593] COND FALSE !(__VERIFIER_nondet_bool()) [L604] CALL is_list_containing_x(&list, x) VAL [l={10:0}, x={10:0}] [L581] COND TRUE l==x [L582] RET return 1; VAL [\result=1, l={10:0}, l={10:0}, x={10:0}, x={10:0}] [L604] is_list_containing_x(&list, x) VAL [is_list_containing_x(&list, x)=1, list={10:0}, tail={10:0}, x={10:0}] [L605] CALL remove(x) VAL [x={10:0}] [L567] FCALL x->R VAL [x={10:0}, x={10:0}, x->R={0:0}] [L567] COND FALSE !(x->R) [L569] FCALL x->L VAL [x={10:0}, x={10:0}, x->L={0:0}] [L569] COND FALSE, RET !(x->L) [L605] remove(x) VAL [list={10:0}, tail={10:0}, x={10:0}] [L606] EXPR &list==x || !is_list_containing_x(&list, x) VAL [&list==x || !is_list_containing_x(&list, x)=1, list={10:0}, tail={10:0}, x={10:0}] [L606] CALL __VERIFIER_assert(&list==x || !is_list_containing_x(&list, x)) VAL [\old(cond)=1] [L5] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L606] __VERIFIER_assert(&list==x || !is_list_containing_x(&list, x)) VAL [&list==x || !is_list_containing_x(&list, x)=1, list={10:0}, tail={10:0}, x={10:0}] [L607] CALL re_insert(x) VAL [x={10:0}] [L574] FCALL x->R VAL [x={10:0}, x={10:0}, x->R={0:0}] [L574] COND FALSE !(x->R) [L576] FCALL x->L VAL [x={10:0}, x={10:0}, x->L={0:0}] [L576] COND FALSE, RET !(x->L) [L607] re_insert(x) VAL [list={10:0}, tail={10:0}, x={10:0}] [L608] CALL, EXPR is_list_containing_x(&list, x) VAL [l={10:0}, x={10:0}] [L581] COND TRUE l==x [L582] RET return 1; VAL [\result=1, l={10:0}, l={10:0}, x={10:0}, x={10:0}] [L608] EXPR is_list_containing_x(&list, x) VAL [is_list_containing_x(&list, x)=1, list={10:0}, tail={10:0}, x={10:0}] [L608] CALL __VERIFIER_assert(is_list_containing_x(&list, x)) VAL [\old(cond)=1] [L5] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L608] __VERIFIER_assert(is_list_containing_x(&list, x)) VAL [is_list_containing_x(&list, x)=1, list={10:0}, tail={10:0}, x={10:0}] [L609] return 0; VAL [\result=0, list={10:0}, tail={10:0}, x={10:0}] [L609] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 95 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 3025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 587]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 587). Cancelled while BasicCegarLoop was constructing difference of abstraction (157states) and interpolant automaton (currently 15 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (78 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. TIMEOUT Result, 75.4s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 69.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 469 SDtfs, 579 SDslu, 1528 SDs, 0 SdLazy, 1992 SolverSat, 307 SolverUnsat, 32 SolverUnknown, 0 SolverNotchecked, 66.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 184 SyntacticMatches, 15 SemanticMatches, 101 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=5, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 559 NumberOfCodeBlocks, 559 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 550 ConstructedInterpolants, 21 QuantifiedInterpolants, 204206 SizeOfPredicates, 31 NumberOfNonLiveVariables, 653 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 66/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 579). Cancelled while IsEmpty was searching accepting run (input had 86 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: is_list_containing_xErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 4). Cancelled while IsEmpty was searching accepting run (input had 86 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: __VERIFIER_assertErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 565). Cancelled while IsEmpty was searching accepting run (input had 86 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: removeErr0EnsuresViolation CFG has 7 procedures, 86 locations, 7 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-24-39-126.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-24-39-126.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-24-39-126.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-24-39-126.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-24-39-126.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_22-24-39-126.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_22-24-39-126.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_22-24-39-126.csv Completed graceful shutdown